All challenges

Construct a high-value increasing sequence with strictly increasing adjacent gcds.

Recover a hidden modular exponent from timing queries to the original interactive device.

Find the hidden pair associated with the large integer source instance.

Estimate divisor counts for hidden integers through the original GCD query protocol.