[2026年5月31日投稿 (v1)、最終改訂2026年7月29日 (本バージョン, v3)]

PDFを表示 HTML（実験的）

要約:The square-and-multiply algorithm, also known as binary exponentiation or repeated squaring, is a standard method for fast exponentiation in modern computation. Its historical origins, however, remain uncertain. This paper examines the emergence and progressive formalization of the method through selected primary sources. Particular attention is given to Jamshid al-Kashi's fifteenth-century Miftah al-Hisab, where the procedure is presented explicitly as a general computational method and claimed by al-Kashi as his own innovation. Earlier instances of successive squaring are identified in the works of al-Uqlidisi and al-Biruni, although in these cases the technique appears in particular calculations rather than as a fully articulated general rule. The earliest known antecedent is found in Pingala's prosodic studies in ancient India (c. 200 BCE), which seem to presuppose the conceptual basis of the method in their use of binary representation. As part of the historical development, Legendre's 1798 worked example is one of the earliest documented European use of the algorithm which appears as a subordinate step within a specific number-theoretic computation. The evidence suggests not a single continuous line of transmission, but the repeated independent reappearance of related procedures in distinct contexts. By the twentieth century, square-and-multiply became a special case within the broader theory of addition chains. By exploring this intellectual progression, this paper sheds some light on the historical background of an algorithm that is prominent in modern computation.

投稿履歴

投稿者: Omid Khormali [メールを表示]
[v1] 2026年5月31日（日）02:17:36 UTC (278 KB)
[v2] 2026年6月6日（土）02:20:00 UTC (21 KB)
[v3] 2026年7月29日（水）03:57:04 UTC (22 KB)