:) Well done!
So glad to see this, though it has been 4 years since then and I am no longer able to spare time to finish the authoring of this kata. But anyway this problem and the solutions to it has their own aesthetic value.

Also please check the most recent fork to see a solution that bypasses all this faff in the first place :)

I was not careful enough to distinguish between and and andi, but it seems that the RISC-V assembler was generous enough to fix them for me :)

I thought mv is pseudoinstruction that used widely...

Thanks, I think I fixed these.

Approved

Approved

Approved

Approved!

Agree.

Approved and merged!

Check if solutions which exploit the outputs for out-of-range inputs are needed here as well

like:

let N be 10000001
then if(n<N) the box gives n + N
else 3*(N - n)

1 gives 10000002, which gives 3
2 gives 10000003, which gives 6
and so on

This fails the f(n-1) < f(n) < f(n+1) check since monotonicity is only checked upto N

My Bad, missed that. thanks for the patient re reviews!

it's fine now