← Back to claim

Flag this claim

You’re flagging the claim:

Pingala's Chandahsutra (~200 BCE) gives a four-aphorism recursive algorithm for counting metrical arrangements of n syllables. The rules ("halve; subtract one when odd; multiply by two; square when halved") implement exponentiation-by-squaring — the same recurrence modern computers use to compute 2ⁿ in O(log n) steps. Halayudha's 10th-century commentary makes the recursion explicit. The algorithm predates Leibniz's binary arithmetic (1703) by ~1,900 years.

A counter-source is required. Flags without sources are disregarded — this filters frivolous flagging and ensures editorial can act on the flag.