Hacker News Board Hacker News, browsed like a classic message board
Live data from Hacker News

An Interesting Pattern in the Prime Numbers: Parallax Compression

novaspivack.com

Post reply on HN
Print view View original

41–50 of 195 posts

Re: An Interesting Pattern in the Prime Numbers: Parallax Compression

#41

Post by airesearcher »

lucb1e wrote: post #28

The Telegram link leads to a distribution channel, not a group, so one cannot actually discuss it there. I let the author know through the contact feature on the website, as it might be unintentional. Edit: The link was changed to a group (at the bottom of the post).

fixed

Re: An Interesting Pattern in the Prime Numbers: Parallax Compression

#43

Post by ssewell »

_rpd wrote: post #33
PurpleBoxDragon wrote: post #17

Is there are particular reasoning or meaning to each dot being 6 numbers? Is there any significant changes if you pick other numbers per dot, following the same pattern? Based on the linked explanation here: https://beta.observablehq.com/@montyxcantsin/unwinding-the-u...

The claim is that it is the same pattern independent of the number of integers per dot.

If the numbers of integers-per-dot was set to 1, the sequence would simply highlight prime numbers as they progress through the pyramid shape since “Parallax Compression” would no longer apply.

Re: An Interesting Pattern in the Prime Numbers: Parallax Compression

#44

Post by ehsankia »

nautilus12 wrote: post #42

Is each row the same as if the remainder on division of the cell number by the row number is 0 then red, otherwise black?

I would also like a clearer explanation of how this was generated, maybe with pseudocode, and would also like to see the larger images mentioned in the post.

As it is, the explanation doesn't really make sense to me.

EDIT: Found this lower down: https://beta.observablehq.com/@montyxcantsin/unwinding-the-u...

Re: An Interesting Pattern in the Prime Numbers: Parallax Compression

#45

Post by enedil »

WaxProlix wrote: post #20

> on January 18, 2018, I found a numerical sequence that generated the exact same pattern as Shaun’s pattern Does this mean that we have a sort of bloom filter-esque test for primality? (ie, it will give you a guaranteed no in O(1) but you'll have to crunch numbers to get the yes?) If so, are there implications for things that want to know "is it prime?" quickly? Crpytography comes to mind, for instance...

We already have quick algorithms that say "is it prime" with certainty. Reducing the required time from O(log^6(n)) to O(1) isn't particularly important from cryptographic point of view.

https://en.wikipedia.org/wiki/Primality_test#Fast_determinis...

Re: An Interesting Pattern in the Prime Numbers: Parallax Compression

#46

Post by asynchrony »

ben509 wrote: post #36
asynchrony wrote: post #25

Earlier quoted context omitted.

Other than the sieve of Eratosthenes being a way to compute a finite list of primes I don't see the relationship here. Could you elaborate?

I think the relationship is that the sieve has a natural shape since it's based on ruling out multiples.

Isn’t the sieve’s eventual shape just the list of prime numbers?

Re: An Interesting Pattern in the Prime Numbers: Parallax Compression

#47

Post by chickenstrips »

toblender wrote: post #23

If this can really map prime numbers to a least a general region, would we be able to break Diffie-hellman key exchange more quickly? If so this could be a huge blow to security. But I must say this is amazing that they were able to visualize prime numbers in this way. These guys are geniuses.

No, this won't help with finding primes. As they noted, the pattern for ranges of size k only holds for k lines. So to find a prime of length N (on the order of 2^N), we need to have k=O(2^(N/2)). However, this yields a guarantee that a prime lies in a range of size O(2^(N/2)), which is not particularly useful. We get exponentially better probabilistic results from the prime number theorem.
Post reply on HN