New method of calculating PI

[rennokki]

I just found out about the paper and I figured out that there is a way to calculate PI's digits faster: https://www.youtube.com/watch?v=rGd7Db52w1Q

[Mysticial]

Interesting formula. But it does not look faster than the Chudnovsky formula. (or even close to it)
I haven't worked out the cost model parameters, but given that the polynomial degree for the BSR recursion is at least 3 and I don't see another large term to go with it, it stands no chance against Chudnovsky.

[rennokki]

Long story short, at the time of the writing I wasn't able to dig into the math, but the math is mathing.

Yes, the Chudnovsky is way faster. The new formula is way too complex, Chudnovsky yields 14 digits per computation and converges fast while the new formula is actually a series; when lambda = [10, 100], 30 computations converge to just 10 decimal places. The Pochhammer index is actually yikes.

The complexity seems to be O(n^2) for both, but it's irrelevant since the Chudnovsky yields 14 digits.

Glad you took a look at it! Thanks! 👍🏼