diff --git a/miden/miden/README.md b/miden/miden/README.md
index dabeab5..243ed25 100644
--- a/miden/miden/README.md
+++ b/miden/miden/README.md
@@ -146,7 +146,7 @@ swap        // stack state: 1 2
 dup.1       // stack state: 2 1 2
 add         // stack state: 3 2
 ```
-Notice that except for the first 2 operations which initialize the stack, the sequence of `swap dup.1 add` operations repeats over and over. In fact, we can repeat these operations an arbitrary number of times to compute an arbitrary Fibonacci number. In Rust, it would look like this (this is actually a simplified version of the example in [fibonacci.rs](src/examples/src/fibonacci.rs)):
+Notice that except for the first 2 operations which initialize the stack, the sequence of `swap dup.1 add` operations repeats over and over. In fact, we can repeat these operations an arbitrary number of times to compute an arbitrary Fibonacci number. In Rust, it would look like this (this is actually a simplified version of the example in [fibonacci.rs](src/examples/fibonacci.rs)):
 ```Rust
 use miden::{Assembler, ProgramInputs, ProofOptions};
 
@@ -243,4 +243,4 @@ When compiled with `concurrent` feature enabled, the VM will generate STARK proo
 Internally, we use [rayon](https://github.com/rayon-rs/rayon) for parallel computations. To control the number of threads used to generate a STARK proof, you can use `RAYON_NUM_THREADS` environment variable.
 
 ## License
-This project is [MIT licensed](../LICENSE).
\ No newline at end of file
+This project is [MIT licensed](../LICENSE).