SethTro · HackerTrans

há 2 mesesdiscuss

Looks like a beat on expectations but that the stock is down slightly after hours

há 3 mesesdiscuss

User input doesn't seem to work. Other classics on the site do work but not Dark Castle (at least for me)

há 5 mesesdiscuss

I've used kiri:moto for several simple CNC projects!

This probably won't scroll to the correct place on the page but there's some images of my project at https://hcc.haus/propmania/#2024-palm-torches and https://static.cloudygo.com/static/Prop%20Making/2024%20Palm...

I used it instead of the terrible closed source Easel App for a CARVEY hobby CNC. For metal milling I find Fusion 360 is necessary.

SethTro

há 8 mesesdiscuss

Yes, the other name in the problem is my sister's name :)

SethTro

há 8 mesesdiscuss

I'm glad you enjoyed! It was a real game I played when driving around.

SethTro

há 8 mesesdiscuss

I wrote Problem 371, https://projecteuler.net/problem=371 , as a high school student in 2012!

I'm so happy to have spent twenty years of my life learning math and solving problems on Project Euler and elsewhere.

SethTro

há 9 mesesdiscuss

Article doesn't seem to mention price which is $4,000 which makes it comparable to a 5090 but with 128GB of unified LPDDR5x vs the 5090's 32GB DDR7.

SethTro

há 9 mesesdiscuss

Is that for [0, 10^12] or for 10^18 + 10^12? Is the 3.75 hrs total core hours or system time?

I wrote https://github.com/sethtroisi/goldbach in the last four hours and I think it's 10-100x faster than your code

  time ./goldbach -t8 -K 1024 -e 100''000''000''000
  real 0m44.133s
  user 3m32.193s
  sys 0m0.092s

  time ./goldbach -t12 -K 1500 -e 1''000''000''000''000
    267468893942 = 267468891139 + 2803 (407)
    926868341768 = 926868338701 + 3067 (437)
    599533546358 = 599533542901 + 3457 (481)
  real 2m3.909s
  user 16m0.729s
  sys 0m37.960s

I know of at least another 4x I could improve it but I've been nerd sniped enough for the night.

I wouldn't trust it 100% but it finds all terms in https://oeis.org/A025018 and https://oeis.org/A025019 and I can verify in https://sweet.ua.pt/tos/goldbach.html

SethTro

há 9 mesesdiscuss

I don't see any benchmarks on your github.

How long does it take for you to test up to 10^9? 10^12?

SethTro

há 9 mesesdiscuss

> Goldbach states: every even number ≥ 4 is a sum of two primes. The naive check for an even n tries many primes p and hopes that n − p is prime. Our idea is simpler: fix a small set of primes Q = {q1, . . . , qK} (the “gear”), and for each even n only test p = n − q with q ∈ Q

I don't see how your idea is different from the naive check. As far as I can tell you are basically saying do the naive check but only up to p > 250-300?

SethTro

há 10 mesesdiscuss

That's the magic part, they aren't

comments