Eventually a Flag — algorithmic delayCTF board
Reversing · Crate-CTF adaptation

Eventually a Flag — algorithmic delay

Inspect the small program summary and identify the algorithmic mistake that causes the flag generation to take impractically long.

PROGRAM SUMMARY def fib(n): return fib(n-1) + fib(n-2) flag generation calls fib(very_large_value) observation: naïve recursion makes an algorithmic delay

Attribution: Adapted from Crate-CTF, 2025 challenge “Eventually a Flag” by Mathias. Used under the MIT License; flags and secrets were replaced for GisVuln. See source and license details.

This GisVuln adaptation is self-contained and does not contact the original challenge infrastructure.