book/zkas: Correct links.

book/src/zkas/bincode.md

@@ -101,5 +101,5 @@ TBD
 ## Decoding the bincode
 
 An example decoder implementation can be found in zkas'
-[`decoder.rs`](https://github.com/darkrenaissance/darkfi/blob/master/zkas/src/decoder.rs)
+[`decoder.rs`](https://github.com/darkrenaissance/darkfi/blob/master/src/zkas/decoder.rs)
 module.

book/src/zkas/examples/sapling.md

@@ -11,7 +11,7 @@ $C$, and we use the burn proof to spend a previously minted _coin_.
 ## Mint proof
 
 ```
-{{#include ../../../../zkas/proofs/mint.zk}}
+{{#include ../../../../proofs/mint.zk}}
 ```
 
 As you can see, the `Mint` proof basically consists of three
@@ -120,7 +120,7 @@ let public_inputs = vec![
 ## Burn
 
 ```
-{{#include ../../../../zkas/proofs/burn.zk}}
+{{#include ../../../../proofs/mint.zk}}
 ```
 
 The `Burn` proof consists of operations similar to the `Mint` proof,

book/src/zkas/examples/voting.md

@@ -15,7 +15,7 @@ with its voter's key on the database, so votes wouldn't be secret.
 ## Vote proof
 
 ```
-{{#include ../../../../zkas/proofs/voting.zk}}
+{{#include ../../../../proofs/voting.zk}}
 ```
 
 Our proof consists of four main operation. First we are hashing the