ckrause

4 ms·

1. 1.▲
   Call for Compute Resources: Mining Integer Sequence Programs with LODA

   1 points by ckrause 5y ago|0 comments
2. 2.▲
   by ckrause 5y ago

   Lexicographical Order Descent Assembly
3. 3.▲
   by ckrause 5y ago

   LODA uses an interpreter at the moment. The problem with a compiler framework is: during mining, you need to generate LOTS of programs and evaluate them quickly. Compilation just takes too long for mining. We don't want to parse descri
4. 4.▲
   by ckrause 5y ago

   LODA v21.9.28 was released yesterday. It allows you to enter your name (if you like) during the setup. If your miner found new or faster programs, your name will be added as a comment to the program. If you run into any issues, feel free to
5. 5.▲
   by ckrause 5y ago

   In general, we can validate only up to a finite number of terms. Yes, there are incorrect programs, because for some sequences there are just too few terms, or it is hard to distinguish the sequence from others. These are the current requir
6. 6.▲
   by ckrause 5y ago

   If you use the latest version, you can specify the "mining mode" when you run "loda setup". The default is "client" mode. If you found programs there are various way to find it out: - You will see ALERT logging
7. 7.▲
   by ckrause 5y ago

   I think it's a nice name :)
8. 8.▲
   by ckrause 5y ago

   There interpreter does not allow cyclic dependencies and the miner won't generate any. There is a difference between "optimization" (static code analysis) and "minimization" (brute-force removal of operations as lon