HNHacker News
TopNewBestAskShowJobs

adgjlsfhk1

8,025 karma · joined January 10, 2021

submissionscomments
adgjlsfhk1··on Raspberry Pi Zero 3W and Pi 4 Model A spotted in device trees
Bluetooth 5.3 with LE audio would also be very nice.
adgjlsfhk1··on Anthropic trained Claude on illegally obtained Stanford professors' books
> What if they get blocked from the network and repeatedly change accounts, IPs and then MACs repeatedly to get around progressively escalating blocks from the network admins?

If you think anyone who makes a new account in a videogame for getting an old account banned should be charged with felony hacking, that's certainly a position you can take...

> What if they run from the police who try to stop them?

Running from police officers isn't generally considered hacking.

adgjlsfhk1··on The Exponential Time Hypothesis Is False [pdf]
no. The DFT result as published uses unlimited precision, but the comparison with the int multiplication shows that the unlimited precision just makes the paper shorter/easier rather than being an exploit in the computation model.
adgjlsfhk1··on The Exponential Time Hypothesis Is False [pdf]
> but either it's wrong or the previous results were wrong, no?

Not quite. This result uses polylog(n) precision which isn't bounded, so it escapes the previous bounds. This doesn't noticably affect the runtime because not all of the math needs this extra precision (in this case you need a couple computations in higher precision but less than n operations), so the extra precision can be payed for even in a TM/circuit model.

adgjlsfhk1··on The Exponential Time Hypothesis Is False [pdf]
The DFT result isn't RAM specific. It holds up in multi-tape turing machines. (it is, however, galactic).
adgjlsfhk1··on The Exponential Time Hypothesis Is False [pdf]
Well optimized radix sorts are actually pretty fast (assuming you have the proper fallbacks to quicksort/insertion sort to deal with medium/small sizes)
adgjlsfhk1··on Solar power is becoming bigger than nuclear
For long term storage, the right batteries don't exist yet (commercially). The good options are going to be one of sodium ion, flow batteries, or thermal batteries.
adgjlsfhk1··on Solar power is becoming bigger than nuclear
The ~grid scale design of this for reference is somewhere around 200mx200mx50m for above ground, or ~100m cube (or bigger) for quarry infill. Such a design is going to get crushed by battery/hydro over the hours/days, but wins on cost for seasonal usage.
adgjlsfhk1··on Solar power is becoming bigger than nuclear
Realistic designs for this can achieve 450C delta t. Your energy store can store at ~1000C (slightly below rock melting point), and run steam turbines with a hot side of 600C and a cool side of 150C.

Over the season, your sand drops from ~1000 to ~600 (which is fine since your power needs drop in the spring)

adgjlsfhk1··on The Exponential Time Hypothesis Is False [pdf]
right, but anything linearly reducable to kSAT is trivially sub-exponential, and a discovery like this means that linear reductions are a whole lot more important than they used to be.

Also for NP problems that can't linear reduce to kSAT just having the knowledge that SAT is sub-exponential (and the tools), makes it a lot more likely that we see a whole lot more problems become exponential.

adgjlsfhk1··on Solar power is becoming bigger than nuclear
That's not really a problem. A spin up over a couple hours matches nicely with the slow sunset over a continent. The sun takes ~4 hours to go from a bit above the horizon in the east coast to a bit below the horizon on the west coast (solar panels make some power in twilight).

Wind also helps since wind makes more power at night, as does demand which is dramatically lower at night.

For coal, Great. Making coal economical is excellent. We should have banned it worldwide 20 years ago.

adgjlsfhk1··on The Exponential Time Hypothesis Is False [pdf]
the presumption is that these results are a side-effect of reinforcement learning to make the models smarter.
adgjlsfhk1··on The Exponential Time Hypothesis Is False [pdf]
OTOH, it would be surprising if this sort of technique didn't apply to other NP problems.
adgjlsfhk1··on The Exponential Time Hypothesis Is False [pdf]
no. It's huge.
adgjlsfhk1··on Woman charged with computer fraud due to scam CashApp account being in her name
It's not (convictable) perjury if it's what the government tells you to say.
adgjlsfhk1··on Woman charged with computer fraud due to scam CashApp account being in her name
Extortion for testimony doesn't tend to produce reliable testimony.
adgjlsfhk1··on The recently proposed o(n log n) integer multiplication algorithm [pdf]
You're dramatically underestimating. You need something like 2^2^2^5000 digits or something crazy like that.
adgjlsfhk1··on The recently proposed o(n log n) integer multiplication algorithm [pdf]
> Lim f/g -> C a constant.

This isn't quite correct. O(g) doesn't require the limit to exist.

adgjlsfhk1··on Κ = 0.003 for integer multiplication crossed
yeah in ram models, this turn into O(n^1-kappa) , but otherwise the result is pretty similar (but you can drop the bit network part since matrix transposition is easy in RAM)
adgjlsfhk1··on Κ = 0.003 for integer multiplication crossed
The tldr is that you can turn a single fft into an n dimensional fft, into n 1d ffts and then share a very small amount of the work of the multiple ffts
adgjlsfhk1··on Κ = 0.003 for integer multiplication crossed
Have you considered looking at this in ram model rather than multi tape? it makes things a lot simpler
adgjlsfhk1··on Anthropic logged net loss of over $80B in first half of 2026
it's probably closer to 50k than 5k
adgjlsfhk1··on Galois Finite Fields and the Advanced Encryption Standard (AES)
> have significant advantages.

Such as?

adgjlsfhk1··on Galois Finite Fields and the Advanced Encryption Standard (AES)
CBC historically was the most popular, but modern applications mostly use GCM which is counter mode. Block mode is too easy to get wrong, and doing it right is ~2x more expensive and less paralellizable.
adgjlsfhk1··on One Hash Bloom Filters
yeah. You also don't need complete independence. You can use partially overlapping bits to get semi-independent hashes.
adgjlsfhk1··on Your C is not standard C
store to a global is typically 0 cycles (although subsequent reads may be slowed down)
adgjlsfhk1··on Auto Research: Integer multiplication below n log n
this fft result works in that model (although it becomes slightly more complicated)
adgjlsfhk1··on Auto Research: Integer multiplication below n log n
likely neither. The current bounds are very ad-hoc robot derived and definitely seem improvable. epsilon seems unlikely as there isn't an obvious reason why overhead should go to 0. I doubt we're anywhere near even being able to convincingly conjecture what the correct lower bound should be.
adgjlsfhk1··on 11 year old unsoundness bugs found in Rust borrow checker
> It leads to broken OOM behaviour

no it doesn't. the broken oom behavior is distros not configuring earlyoom/systemd-oom properly. The problem here is that the kernel doesn't know what software is critical to your OS so the distro needs to be responsible for what processes to protect.

For apps that need to handle oom, Linux is missing something a handle to tell apps to shrink their memory use. Apple does this and it seems to work quite well (and proves that Linux style overcommit works well since it's what they use)

adgjlsfhk1··on Auto Research: Integer multiplication below n log n
no it doesn't. making the table takes O(2^n) time
← PreviousPage 2 of 34Next →