/explore
|
You are here 
|
www.bearssl.org | ||
| | | | |
cronokirby.com
- Read more: https://cronokirby.com/posts/2021/04/constant-time-big-numbers-introduction/ |
|
| | | | | ||
| | | | |
kevinventullo.com
Suppose you knew that 9,273,284,218,074,431 was a perfect 7th power. How would you compute the 7th root? This is a long overdue sequel to the previous post, in which the author promised to derive an efficient algorithm for computing exact k-th roots of integers. That is, computing the k-th root of an integer assumed to... |
|
| | | | | ||
| | | | |
mark.engineer
[AI summary] The user shared an extensive account of their project to compute the first 255 digits of π using an Intel 4040 CPU, which is over 50 years old. They described their hardware setup, firmware modifications, and optimization techniques to achieve the computation within a significantly reduced time compared to earlier estimates. The project involved custom firmware, precise timing control, and a spigot algorithm to calculate π's digits efficiently on vintage hardware. The final run completed the task in approximately 69 hours, showcasing the potential of optimizing algorithms for older processors. |
|
| | | | | ||
| | | | |
fabricebaudoin.blog
In two works in collaboration with Erlend Grong, Gianmarco Molino and Luca Rizzi, we introduced the notion of H-type structure: H-type foliations Comparison theorems on H-type sub-Riemannian manifolds Consider a triple $latex (\mathbb{M}, \mathcal{H}, g)$ where $latex \mathbb{M}$ is a manifold, $latex \mathcal{H}$ a constant rank sub-bundle of the tangent bundle of $latex T \mathbb{M}$... |
|
| | | |||
