Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
jlokier
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
11 ms
·
121.
▲
by
jlokier
1y ago
Yup. Once it took Vivado 40 minutes just to add one small Verilog file to a project. Not to compile it. Just to add it to the list of project source files, for which it scanned the file for definitions. Each time I edited the file, Vivado s
122.
▲
by
jlokier
1y ago
onlyrealcuzzo wrote: > Google is pretty useful. It uses 15 TWh per year. 15TWh per year is about 1.7GW. Assuming the above figures, that means OpenAI and Nvidia new plan will consume about 5.8 Googles worth of power, by itself. At tha
123.
▲
by
jlokier
1y ago
From a physics point of view, continuous transmission and correlation detection of a temporally- and spatially-diverse optical signal over the entire field of view addresses the problem of energy being spread out, and gets you better, more
124.
▲
by
jlokier
1y ago
To my mind, "think of the children" is something I've only ever seen as a motivating force of anti-liberal politics. With liberals saying the "think of the children" argument is a specious, misdirecting, crude app
125.
▲
by
jlokier
1y ago
There's still a market, but when I looked into COBOL work out of curiosity (I've never been anywhere near it in real life), the salaries I found were surprisingly low, compared with common modern languages. Perhaps the old adage &
126.
▲
by
jlokier
1y ago
> All sugars have chirality so they would need some enzymes to eat their own mirrored sugars and another set of enzymes to eat normal sugars. Until mirrored life evolves enzymes to eat non-mirrored sugars, mirrored life will be at a la
127.
▲
by
jlokier
1y ago
> All sugars have chirality so they would need some enzymes to eat their own mirrored sugars and another set of enzymes to eat normal sugars. Until mirrored life evolves enzymes to eat non-mirrored sugars, mirrored life will be at a la
128.
▲
by
jlokier
1y ago
> You could make sensitive data non-screenshottable and non-photographable. That made me curious, so I took a photo of my laptop screen running this page. With default camera settingse, the text wasn't visible to me in the photo o
129.
▲
by
jlokier
1y ago
You can actually use an alternative authenticator app for Microsoft logins. I use Aegis on my phone for it. They don't make it clear in the messaging during the sign-up flow, which just says Microsoft Authenticator everywhere. But wh
130.
▲
by
jlokier
1y ago
That's why I described a not very well known trick that requires just +1 line, the definition of hash(). It's neither fast nor maintainable, it's just a neat hack that gives you some of the performance of hash tables for neg
131.
▲
by
jlokier
1y ago
This branch of the discussion is is about dereferencing on multiple threads concurrently. That doesn't block the application, each mmap'd dereference only blocks its own thread (same as doing read()). In my own measurements with
132.
▲
by
jlokier
1y ago
That's actually the same as Java, with its "checked exceptions" (aka listed in function signatures), and the RunTimeException hierachy which don't have to be listed. In Java common errors and exceptions, like file I/
133.
▲
by
jlokier
1y ago
It's not 0.8^10 anyway, because there aren't 10 neighbours. There are neighbours in both directions in each dimension, i.e. 20 neighbours in 10 dimensions if you're allowed to wrap around the edges of the lattice. With wrappi
134.
▲
by
jlokier
1y ago
I remember going to an outside toilet in the UK...
135.
▲
by
jlokier
1y ago
If you can search (and do other operations) on a linked list, and the lists are long enough to matter, you can trivially speed it up to a fixed-size hash table with hardly any code changes. This: entry = list_search(key, list); bec
136.
▲
by
jlokier
1y ago
In my experience, in the UK, the rental agency required 12 months rent in advance (plus another 2 months rent as deposit) when I was self-employed. They would have accepted monthly rent if I had 5x the annual rent in cash savings, but I di
137.
▲
by
jlokier
1y ago
You're right about the VMM. But three out of those four features: page cache, dynamic I/O buffering and shared memory between processes, do not require that kind of VMM subsystem, and memory-mapped files don't require it for
138.
▲
by
jlokier
1y ago
Those features don't require an MMU. The no-MMU version of Linux has all of those features except that memory-mapped files (mmap) are limited. These features are the same as in MMU Linux: page cache, dynamic I/O buffering, shared
139.
▲
by
jlokier
1y ago
There are many options. Executables can be position-independent, or relocated at run-time, or the device can have an MPU or equivalent registers (for example 8086/80286 segment registers), which is related to an MMU but much simpler.
140.
▲
by
jlokier
1y ago
The AMD Processor Programming Reference manuals are also good for this, if you like complete and detailed. They complement the Intel manuals. Much the material is duplicate because the processors are so similar, but written in a different
141.
▲
by
jlokier
1y ago
Having read [1] in particular, I think you're right and I was mistaken. Thanks! That's quite eye-opening for me, as I followed discussion about GPLv2 and GPLv3 for years yet didn't know about this view of GPLv2 and reinstal
142.
▲
by
jlokier
1y ago
For example, Starling Bank in the UK. They have a nice web app, but you must use their mobile app to login on the web version. The app takes a video of a QR code on the web page during login. Web login completes as soon as the mobile app no
143.
▲
by
jlokier
1y ago
Locked bootloaders are probably not a GPLv2 violation, and probably are a GPLv3 violation. This type of situation was a major reason GPLv3 was created. Another was clarification of some grey areas (these are the reason for "probably&qu
144.
▲
by
jlokier
1y ago
Since we're talking about the UK, in 2010 negotations after a hung parliament produced an opportunity to move towards something a little more representative: The 2011 referendum on changing to AV voting from first-past-the-post. Unfort
145.
▲
by
jlokier
1y ago
I've had that happen twice! Recently I asked for my software developer colleage to be bought a 24 GB Macbook Air instead of 16 GB, and boss came back with "not everyone needs a super-big machine like yours Jamie!". They serio
146.
▲
by
jlokier
1y ago
> Is it possible to allocate wait queue nodes on the kernel stacks of waiting threads as well? Yes, this is exactly what's done. The queue node is an declared as a local variable in kernel code, i.e. on the kernel stack, and its
147.
▲
by
jlokier
1y ago
DeepMind was founded in London, UK and still headquartered there, and is one of the leaders in the field.. Notable well-known things from DeepMind are AlphaGo (the first time a computer beat a world champion at Go), AlphaFold (resulting in
148.
▲
by
jlokier
1y ago
Perhaps they meant to write WaitOnAddress, which is the same as a basic futex.
149.
▲
by
jlokier
1y ago
ext4 or btrfs won't save you either. Although that bug report is for ZFS on the same SSD as the Windows article (WD SN770), the faults described in the Linux bug report look like would also happen with ext4 or btrfs. So I searched for
150.
▲
by
jlokier
1y ago
That's up to you. But if you have one of the SSD models the article is about, Linux probably won't help. It might make it worse. Linux is beautifully optimised for performance. Linux is more likely to write the same data more q
More ›