diff --git a/README.md b/README.md
index f2f30cb..5a35763 100644
--- a/README.md
+++ b/README.md
@@ -16,7 +16,7 @@ This table includes a list of the examples that are currently available in the r
 | [EC Secret Key Knowledge](https://github.com/akosba/xjsnark/tree/master/doc/code_previews/README.md#ec-secret-key-knowledge)| This example illustrates the customizable non-native finite field types. You can check FieldDefTable for the field definition. Note that the complexity of the code does not change when the field is different from the field that the zk-SNARK circuit uses. This example proves the knowledge of a secret key for an ECDSA public key using the Nist P-256 curve.  | 687228 |
 | [Sudoku 9x9](https://github.com/akosba/xjsnark/tree/master/doc/code_previews#sudoku-9x9)  | This example shows how to write an efficient circuit proving the knowledge of a valid 9x9 sudoku puzzle solution, using built-in permutation verification and constraints on native field elements. | 756 |
 | [Sorting](https://github.com/akosba/xjsnark/tree/master/doc/code_previews/README.md#sorting)  | This example illustrates how to use the external code blocks for non-determinism (setting the values of the external witnesses provided by the prover), and the usage of the permutation verification native instruction which could enable writing more optimized circuits for some applications, like sorting, or pointer chasing. The reported cost is for sorting an array of 1024 16-bit unsigned integers.  | 29166 |
-| [ZeroCash Pour Circuit](https://github.com/akosba/xjsnark/tree/master/doc/code_previews/README.md#zerocash-pour-circuit)| High-level implementation of the Pour circuit in the [ZeroCash](http://zerocash-project.org/media/pdf/zerocash-extended-20140518.pdf) paper, that results into an optimized circuit similar to the manually-optimized circuit. The number of constraints reported assumes a height of 64 for the Merkle trees. | 3814991 |
+| [ZeroCash Pour Circuit](https://github.com/akosba/xjsnark/tree/master/doc/code_previews/README.md#zerocash-pour-circuit)| High-level implementation of the Pour circuit in the [ZeroCash](http://zerocash-project.org/media/pdf/zerocash-extended-20140518.pdf) paper, that results into an optimized circuit similar to the manually-optimized circuit. The number of constraints reported assumes a height of 64 for the Merkle trees. | 1144454 |
 | [RSA Modular Exponentiation](https://github.com/akosba/xjsnark/tree/master/doc/code_previews/README.md#rsa-modular-exponentiation)  | This example shows how to use the long integer modular arithmetic supported by xJsnark to implement modular exponentiation for RSA. This is supported through a type for the multiplicative group of integers modulo N. See the code for more notes. This version includes examples for fixed modulus fixed exponent and fixed modulus variable exponent. Support for types with variable modulus has not been pushed to the front end of this version yet. Note that [Jsnark](https://github.com/akosba/jsnark/tree/master/JsnarkCircuitBuilder/src/examples/gadgets/rsa) has implementations that can support all these cases and includes the optimizations of xJsnark. The reported cost in this table is for a hardcoded 2048-bit modulus and a hardcoded exponent 0x10001. | 88949 |