Viewing profile — jdewerd
jdewerd
HN member- Joined
- Fri, Dec 08, 2023, 12:46 AM UTC
- HN karma
- 662
- Public activity
- 171 items
- HN profile
- View on Hacker News ↗
About jdewerd
Recent public activity
- comment
-
comment
Comment #47675829
Loads of games from the era roundtripped their textures through lossy S3/DXT compression and then stored them as uncompressed RGB or RGBA. I know this because I wrote a Unreal Engi…
-
comment
Comment #45904152
How long until it comes with a DRM AI and then my anti-DRM AI will have to fight it in a virtual arena (with neon lights and killer soundtrack, of course)?
-
comment
Comment #45878840
ISM is thriving, the only tragedy is that carriers haven't figured out how to charge rents on it and that's a tragedy for them , it's a spectacular success for everyone using it fo…
-
comment
Comment #45878103
Completely independent of bandwidth, higher frequencies also fall off faster. That's bad if you are trying to cover max space but good if you are trying to avoid noisy neighbors.
-
comment
Comment #45878033
I never said anything about free or government-run WiFi, just about auctioning off the spectrum. Companies that build out the infrastructure should be able to charge for access, bu…
-
comment
Comment #45877670
The most efficient way to extract money from people is to sell off the spectrum to the highest bidding rent seeker, I agree. As for most efficient use of the resource, well, consul…
- comment
-
comment
Comment #42933070
Is that because defense doesn't like them or is it because (non-wartime) defense moves on geological timescales and these are "new"?
- comment
- comment
-
comment
Comment #42587632
Yes, but the more we mix sieve rejection into candidate selection the more we complicate the rule of thumb. "Reject even numbers as prime candidates" is probably OK to leave as an …
-
comment
Comment #42587036
Yes, excellent point! I originally omitted this detail for simplicity, but on reflection I don't think it actually achieved much in the way of simplifying the rule so I changed it …
-
comment
Comment #42586168
> The prime-counting function approximation tells us there are Li(x) primes less than x, which works out[5] to one prime every 354 odd integers of 1024 bits. Rule of thumb: Want a …
-
comment
Comment #42544121
Oh, he only busted the Great Depression, won WWII, built half of the infrastructure that we keep kicking the expiration date on, and negotiated 80% of the beneficial fine print in …
- comment
-
comment
Comment #42451749
I love cheap and reliable TP-Link routers as much as the next guy, but it's definitely also a security issue. The CCP almost certainly has a backdoor. Maybe a respectable one in th…
- comment
- comment
-
comment
Comment #42427292
I thought Shor's algorithm could attack ECC too and the lattice crypto with the sci-fi crystal names (Kyber and Dilithium) was the response? If I go to https://www.google.com using…
-
comment
Comment #42427219
Cool, I hadn't run into it before so thanks for introducing me! I was going to include the digits for comparison, but yes, on second thought 6002 digits is probably too much for po…
-
comment
Comment #42426978
The 50 000 000th prime is 982451653, but fun fact: you may have already memorized a prime much larger than this without even realizing you have done so! 2^255-19 This is where Curv…
- comment
- comment
- comment