Random Alternatives

Random reviews and mentions

• How do computers use imaginary numbers to give the results of things like the riemann zeta function?
  1 project | /r/mathematics | 21 May 2023

  Sure here is a an example (repository) (click "run" to see it work) contrasting the two in Rust, note that it is not fully symbolic, just the imaginary component. But the immediate advantage one can see is allowing direct computation without needing to modify the polynomial multiplication algorithm. (As noted in the source code, this is a purely theoretical advantage).

• Hey Rustaceans! Got a question? Ask here (11/2023)!
  7 projects | /r/rust | 13 Mar 2023

  I can't help you with the specific website, but here's a trivial cli implementation of Game of Life.

• Announcing Malachite, a new arbitrary-precision arithmetic library
  6 projects | /r/rust | 6 Jun 2022

  I've been sitting on my hands when it comes to updating my library, but if you really want a fast test, you can use some of my research/implementation for RCPrime, with creditation of course. I'm not sure what algorithms FLINT uses, but I'm fairly certain that the RCPrime implementation is the most efficient for integers less than 2^35 (requiring 64 multiplications and only one strong fermat test) even if you implement with Montgomery exponentiation.

• Tip of the Day: Fast Division
  1 project | /r/learnprogramming | 10 May 2022

  Here is a sample implementation along with the inverses of the first 128 primes (in hex). (Except 2, which can be easily checked by the &1 trick)

• What problems are you solving?
  1 project | /r/AskComputerScience | 17 Apr 2022

  Not what one normally considers in CS, but producing a fast deterministic test for checking primality in the interval 0;2^64 with some extensions beyond. Fully constructing one to 2^128 is well beyond what is currently computable, however some progress has been made that surpasses published bounds.

• What's everyone working on this week (12/2022)?
  6 projects | /r/rust | 21 Mar 2022

  Working on developing a faster and smaller primality check in the interval 0;2^64 with tentative extensions towards 2^65. While it performs satisfactorily for the intervals currently available, reducing the memory to less than other implementations is a major challenge.

• RFC: first Rust program (a hello world)
  2 projects | /r/rust | 29 Jan 2022

  See this other approach for a similar engine, that utilizes a linear bitvector to model cellular automata.

• IQpills from a grad student
  1 project | /r/greentext | 16 Jan 2022

  You are way overthinking it. For something like minesweeper you can just model an integer lattice, and use either a 1d vector of integers to represent the positions of the mines or a 1d bitvector and check the values in the chebyshev distance of 1 from the point. (If you use integers like in the first example, your system becomes a plane of 2^32, 2^32 dimensions and is bounded by the number of mines (64-bit integers) that can fit in your RAM)

• 99 is breaking my isPrime function
  1 project | /r/cpp_questions | 24 Sep 2021

  You can look here for some slightly better ways to test for primality (ignore the different language).

• In languages like C#, how long (relatively) do different common operations general take?
  1 project | /r/AskComputerScience | 24 Sep 2021

  RAND calls a hardware source of Johnson-Nyquist noise (basically electric static), and then performs some filtering on it to make sure that it's evenly distributed. There are faster methods, like a simple "linear" rng, but they frequently don't give as good results.

• A note from our sponsor - SaaSHub
  www.saashub.com | 15 Mar 2025

  SaaSHub helps you find the best software and product alternatives Learn more →