Talk:CalmoSoft primes: Difference between revisions
Content added Content deleted
(Further comment on timings.) |
(Note about sequence length) |
||
| Line 31: | Line 31: | ||
:::::No, there's a single pass compiler which parses the Wren source directly to bytecode (no intermediate AST) which the VM then interprets. A number of devices are used to make Wren faster though I can't see JIT compilation happening as it would make the VM too complicated. --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 14:03, 9 April 2023 (UTC) |
:::::No, there's a single pass compiler which parses the Wren source directly to bytecode (no intermediate AST) which the VM then interprets. A number of devices are used to make Wren faster though I can't see JIT compilation happening as it would make the VM too complicated. --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 14:03, 9 April 2023 (UTC) |
||
===Sequence length=== |
|||
I agree with the above comments about the majority of the time going in finding the primes under 50 000 000, however I did notice some performance improvement by considering the sequence lengths - assuming the sequence is more than 1 prime long: |
|||
* If the sequence starts with 2, it must have even length. |
|||
* If the sequence starts with 3 or more, it must have odd length. |
|||
--[[User:Tigerofdarkness|Tigerofdarkness]] ([[User talk:Tigerofdarkness|talk]]) 10:04, 10 April 2023 (UTC) |
|||