Embed Notice

HTML Code

<blockquote style="position: relative; padding-left: 55px;"><section><a href="https://mastodon.gamedev.place/users/lritter/statuses/114397872121131203">Leonard Ritter (lritter@mastodon.gamedev.place)'s status on Friday, 02-May-2025 07:16:15 JST</a><a href="https://mastodon.gamedev.place/@lritter" title="lritter@mastodon.gamedev.place"><img src="https://gnusocial.jp/avatar/11596-48-20220929134937.webp" width="48" height="48" alt="Leonard Ritter" style="position: absolute; left: 0; top: 0;">Leonard Ritter</a><div><a href="https://mastodon.gamedev.place/@lritter/114386948427816534" rel="in-reply-to">in reply to</a></div></section><article><p>still refactoring prover.cpp. for every reported compiler error i see i fix all similar patterns in the file, and yet i am still at line 1703 of 4390 (38%). but through this method, progress should be exponential-- or wait, this pattern matches the one of the sieve of eratosthenes (<a href="https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes" rel="nofollow noreferrer">https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes</a>), so progress should follow the distribution of "new problems" in the file (each problem equivalent to a prime). it's interesting to think about</p><p><a href="https://mastodon.gamedev.place/tags/devlog" rel="tag">#devlog</a> <a href="https://mastodon.gamedev.place/tags/scopes" rel="tag">#scopes</a></p></article><footer><a rel="bookmark" href="https://gnusocial.jp/conversation/4987728#notice-9773540">In conversation</a><time datetime="2025-05-02T07:16:15+09:00" title="Friday, 02-May-2025 07:16:15 JST">about 16 days ago</time> <span>from <span><a href="https://gnusocial.jp/notice/9773540" rel="external" title="Sent from gnusocial.jp via ActivityPub">gnusocial.jp</a></span></span><a href="https://gnusocial.jp/notice/9773540">permalink</a><h4>Attachments</h4><ol><li><article><header><div>Domain not in remote thumbnail source whitelist: upload.wikimedia.org</div><h5><a href="https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes">Sieve of Eratosthenes</a></h5><div></div></header><div>In mathematics, the sieve of Eratosthenes is an ancient algorithm for finding all prime numbers up to any given limit.
It does so by iteratively marking as composite (i.e., not prime) the multiples of each prime, starting with the first prime number, 2. The multiples of a given prime are generated as a sequence of numbers starting from that prime, with constant difference between them that is equal to that prime. This is the sieve's key distinction from using trial division to sequentially test each candidate number for divisibility by each prime. Once all the multiples of each discovered prime have been marked as composites, the remaining unmarked numbers are primes.
The earliest known reference to the sieve (Ancient Greek: κόσκινον Ἐρατοσθένους, kóskinon Eratosthénous) is in Nicomachus of Gerasa's Introduction to Arithmetic, an early 2nd century CE book which attributes it to Eratosthenes of Cyrene, a 3rd century BCE Greek mathematician, though describing the sieving by odd numbers instead of by primes.
One of a number of prime number sieves, it is one of the most efficient ways to find all of the smaller primes...</div><footer></footer></article></li></ol></footer></blockquote>

Corresponding Notice

Embed this notice
Leonard Ritter (lritter@mastodon.gamedev.place)'s status on Friday, 02-May-2025 07:16:15 JST Leonard Ritter
in reply to
still refactoring prover.cpp. for every reported compiler error i see i fix all similar patterns in the file, and yet i am still at line 1703 of 4390 (38%). but through this method, progress should be exponential-- or wait, this pattern matches the one of the sieve of eratosthenes (https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes), so progress should follow the distribution of "new problems" in the file (each problem equivalent to a prime). it's interesting to think about
#devlog #scopes
In conversationabout 16 days ago from gnusocial.jppermalink
Attachments
1. Domain not in remote thumbnail source whitelist: upload.wikimedia.org
  Sieve of Eratosthenes
  In mathematics, the sieve of Eratosthenes is an ancient algorithm for finding all prime numbers up to any given limit. It does so by iteratively marking as composite (i.e., not prime) the multiples of each prime, starting with the first prime number, 2. The multiples of a given prime are generated as a sequence of numbers starting from that prime, with constant difference between them that is equal to that prime. This is the sieve's key distinction from using trial division to sequentially test each candidate number for divisibility by each prime. Once all the multiples of each discovered prime have been marked as composites, the remaining unmarked numbers are primes. The earliest known reference to the sieve (Ancient Greek: κόσκινον Ἐρατοσθένους, kóskinon Eratosthénous) is in Nicomachus of Gerasa's Introduction to Arithmetic, an early 2nd century CE book which attributes it to Eratosthenes of Cyrene, a 3rd century BCE Greek mathematician, though describing the sieving by odd numbers instead of by primes. One of a number of prime number sieves, it is one of the most efficient ways to find all of the smaller primes...

Public

Embed Notice

HTML Code

Corresponding Notice