Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
dom0
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
56 ms
·
571.
▲
by
dom0
9y ago
There are some more specialised enterprises, e.g. for T&M there is artekmanuals and some others ("The" Schaltungsdienst comes to mind). There are a bunch of other sites like manualslib, usually with a narrower focus, and there
572.
▲
by
dom0
9y ago
On the other hand it's fairly easy to not break Python's memory model if you don't unlock the GIL :) Edit: Ah that kind of bug can be ... tricky.
573.
▲
by
dom0
9y ago
It's not like it should surprise anyone. The import machinery in Python 2 was mostly written in C, while it's pure Python in Python 3. And if you've seen what that stuff does it's no surprise that even fairly small appli
574.
▲
by
dom0
9y ago
Reviewing dependencies avoids dragging shitty, obviously broken and/or horrifically inefficient code around. You don't want to use a data serialization library that is so poorly written that it likely corrupts stuff sooner or late
575.
▲
by
dom0
9y ago
The Z3 is a floating point machine... I'd wager that it is more complex than the 4004. While the 4004 has a couple more transistors than the Z3 had relays (about 600 in the "CPU"), the telephone relays used by the Z3 had many
576.
▲
by
dom0
9y ago
Their output is quite alright for straightforward algorithms (crypto, checksums, simpler data processing, nothing meaty like video codecs, don't know anything about that). Though it is of course a good idea to always check.
577.
▲
by
dom0
9y ago
Yes, thinking about it that alone is not sufficient. Still, I'd claim that most languages are not context free. CPP (Pre-processor) aside, C is not context free due to typedef making identifiers ambiguous. Also if-then-else? Since C++
578.
▲
by
dom0
9y ago
Nowadays Sphinx is quite usable for writing both long-form documentation and reference docs. It's a really complex piece of software ( much more complex than everyone thinks at first), but most of the time that isn't noticeable.
579.
▲
by
dom0
9y ago
Most programming languages are context-sensitive [1] (at least with unbounded nesting), so parsing them correctly and efficiently is mathematically impossible. All practical implementations have to take shortcuts. [1] Mainly due to begin.
580.
▲
by
dom0
9y ago
> Initially this question was going to be "can we log executed instructions" but I rapidly realized that not even DDR5 could keep up with such a logging system - it would slow things down too much and likely mask the bug (not t
581.
▲
by
dom0
9y ago
https://news.ycombinator.com/item?id=14480282 At least the part where a different process crashes sounds really more like a hardware problem, although it could of course also be a Kernel<->Hardware issue. There is a
582.
▲
by
dom0
9y ago
Tickets from users using overclocked components are generally INVALID CLOSED.
583.
▲
by
dom0
9y ago
These are often not packaged, so less available. Though for some applications you wouldn't want a library anyway. (Also, xxhash)
584.
▲
by
dom0
9y ago
> SHA-512/256 is a made-up algorithm It's a published FIPS.
585.
▲
by
dom0
9y ago
I think the BLAKE2 authors just choose to call it "keyed hashing" and telling people to use it as a MAC. Only somewhere in the paper where the construction is described there is an embedded clause "yes yes, that's prefix
586.
▲
by
dom0
9y ago
SHA-512/256 is a variant of SHA-512 where the output is truncated to 256 bits. It does not mean "SHA-512 or SHA-256". Yes, perhaps a different symbol than "/" would be better there.....
587.
▲
by
dom0
9y ago
The answer is that you don't want a hash, you want a solution that is ArchiSig or TR-ESOR (or something similar) compliant.
588.
▲
by
dom0
9y ago
If SHA-2, do use SHA-512, since we are living in a 64 bit world.
589.
▲
by
dom0
9y ago
I'm not that sure about that. In the history of cryptography almost everything was broken in the end (though some peculiar stuff took a couple hundred years), but it seems that with modern cryptography, which is very, very different
590.
▲
by
dom0
9y ago
I've seen it written as "SHA-2 512-256", which is a bit less confusing.
591.
▲
by
dom0
9y ago
While the portable, pure C implementation of BLAKE2 that is used almost exclusively by libraries (e.g. Python, OpenSSL) is already faster than MD5... ...there are even faster implementations of BLAKE2 around. E.g. Samuel Neves' AVX2 im
592.
▲
by
dom0
9y ago
Comprehensions have their own opcodes which directly call e.g. PyList_Append with no further checks or lookups in each iteration.
593.
▲
by
dom0
9y ago
On Windows, VTune supports managed code sampling (Java, Python, ...); it basically decodes the internal state of the VM (such as PyEval_FrameEx). The basics work on Linux as well, but as usual setup is more painful due to kernel issues. The
594.
▲
by
dom0
9y ago
https://news.ycombinator.com/item?id=14376961 Further, it doesn't help with the required restructuring; when the functionality is scattered across a dozen or more modules (complex software + good Python practice), then
595.
▲
by
dom0
9y ago
Couple notes about cProfile - The slowdown is difficult to predict and somewhat unstable; never compare timings from runs with/without cProfile - It's a deterministic, wall-clock profiler - pyprof2calltree & kcachegrind. - L
596.
▲
by
dom0
9y ago
Almost everything starts to make noises at higher currents (e.g. CPU voltage regulator). You have of course coils making noise, you have ceramic capacitors making noise to due piezoelectricity, even good old fashioned electrolyte caps can m
597.
▲
by
dom0
9y ago
> You may be significantly underestimating your ability to get phenomenal gains from algorithmic improvements. Implementation differences in the exact same, say, simple linear algorithm, can still add up to a tenfold difference. Compiler
598.
▲
by
dom0
9y ago
Python performance is uh ah... difficult. I work on a piece of software that has a lot of hot paths in Python code, and it's not nice. Combined with deployment and tooling issues it made me wonder quite a few times now, whether the a l
599.
▲
by
dom0
9y ago
There are many applications for MACs and keyed hashes, not all involve encryption (e.g. hash-based deduplication). All mainstream AEAD constructions (AES-GCM, Chapoly, AES-OCB) also generate "only" 128 bit authentication tags, whi
600.
▲
by
dom0
9y ago
> "Easier to implement in hardware" will be more compelling when such hardware exists. Most things are software; from previous experience we know that it basically takes 10 to 15 years between introduction of a primitive (AES a
More ›