We propose and analyze a chord summation algorithm, which combines the ideas of Viète and Archimedes to calculate the value of π. The error of the algorithm decreases exponentially per iteration and becomes pinched at a critical iteration, depending on the accuracy of the first input value, √2. The critical iteration is also analyzed.