The complete ladder exposes each recomputed row and the final modular result. There is no giant decimal intermediate to trust.
Read the whole ladder
The full table shows prior result, square, optional multiply, and row result for each bit.
one row per bit
First row starts from one
The first row starts from 1, squares to 1, multiplies by base, and ends at 7.
Next one bit multiplies again
The next row carries prior result 7, squares to 16, multiplies, and ends at 13.
16⋅7mod33=13
The zero bit keeps the square
The zero-bit row squares prior result 13 to 4 and skips multiply, so the result stays 4.
skip multiply⇒4
Last one bit finishes
The final one-bit row squares 4 to 16, multiplies by base, and returns 13.
16⋅7mod33=13
Count the rows
The exponent has 4 bits, so the table has 4 rows.
rows=4
Final result
The last row result is 13.
713mod33=13
Summary
The displayed result is recomputed from the pinned inputs and every row of the ladder.
ladder result verified