jepler

41 ms·

451.
by jepler 9y ago
I'm glad this seems to validate the numbers I'd calculated last year based mostly on wikipedia sources: https://emergent.unpythonic.net/01471617505 It's a curious fact that in my area the fuel/energy cos
452.
by jepler 9y ago
poettering continues to amuse/dismay. he and the projects that are synonymous with his personality might benefit greatly (if only in public perception) if he took a break from being their public face and staunchest defender.
453.
by jepler 9y ago
thanks for the correction, I scanned too quickly..
454.
by jepler 9y ago
OK, so where do I get a mosh client programmed in WebAssembly? Without it, my chromebooks might as well be bricks.
455.
by jepler 9y ago
.. in part due to assuming that the price of the internal combustion engine is "going to go up as a result of more stringent regulations especially regarding to particulate regulations", but also assuming that the battery (A) acco
456.
by jepler 9y ago
g-d those are some deceptive graphs! Take a look at the slide titled "Pushing the performance envelope". A 16% improvement (LMBench memcpy) is displayed so that it looks like a 164% improvement (size of bar increased from 50px t
457.
by jepler 9y ago
Personally I'd rather see my github integration as a subcommand: 'git hub clone foo/bar', etc.
458.
by jepler 9y ago
you're .. mad that github is going to write down some rules about how their software works in practice, publish those rules, and then try to hold to those rules as their software continues to evolve?
459.
by jepler 9y ago
This is why you should use clever language features such as macros (C) and pointers to member data (C++). If your code looks like this, there's no scope for accidentally comparing two fields in the same object, or comparing different
460.
by jepler 9y ago
curl: (6) Could not resolve host: xip.io curl: (7) Failed to connect to www.xip.io port 80: Connection timed out but the front page is cached at http://webcache.googleusercontent.com/search?q=cache:o8L_uDk... with google si
461.
by jepler 9y ago
among the people who have not had success with this method are Marc Maron and Ed Nisley http://rovinggastronome.com/mainblog/2014/05/12/kitchen-psa-... https://softsolder.com/2016/11
462.
by jepler 9y ago
The author states a purpose at http://yosefk.com/c++fqa/why.html and more at http://yosefk.com/c++fqa/faq.html
463.
by jepler 9y ago
"Design You're Companion" lel
464.
by jepler 10y ago
cbmc doesn't execute C(++) programs, but rather it turns them into instances of the SAT problem, which it then passes off to a SAT prover to (hopefully) prove it. It's assert() (and assume() and nondet_xxx() which are not mention
465.
by jepler 10y ago
As I type this, I'm waiting for a process that could have a parallelism of about 9,000 threads but it's running on a mere 12-core machine (compiling a large C++ project). Bring on the "20 or 100 CPUs" for my next comp
466.
by jepler 10y ago
Yup, a hidden assumption that I didn't state is that 'n' is modest and of course 'log n' is very modest. For example, n = 256 might be the case on a microcontroller doing realtime activities. proving you never exha
467.
by jepler 10y ago
Nonsense. Here is one implementation of the pair of functions which have deterministic running times, and may even comply with the C standard: void *malloc(size_t _) { return NULL; } void free(void *ptr) {} More seriously, I
468.
by jepler 10y ago
You sure might imagine you need to. For instance, suppose you want to average pieces of data that are timestamped "almost the same", but could arrive to be processed with varying delays, including out of order arrival (so you can
469.
by jepler 10y ago
Yes, though I'm specifically talking about when you decide to define a 'bool less_than(double, double)' that uses some kind of fuzzy comparison approach internally. This can affect any platform, not just one with the "b
470.
by jepler 10y ago
The operator overlooks my pet peeve when it comes to comparing floating-point numbers: in C++ the "standard associative containers" (std::set and std::map) are based on ordering using an less-than relationship which must be a &quo
471.
by jepler 10y ago
I can only guess what thread you meant to link to here. This one from 2011(!) before the first block reward halving(!!)? http://bitcoin.stackexchange.com/questions/876/how-much-will...
472.
by jepler 10y ago
Hm, if the task is to identify a set of fixed headers at a variety of file offsets, what you really want is a rolling hash ( https://en.wikipedia.org/wiki/Rolling_hash ). Select a rolling hash of size N, no bigger than
473.
by jepler 10y ago
the code is not exactly memcmp, because the sign of the result doesn't match the sign of memcmp. I verified this with my favorite open source C program prover, CBMC http://www.cprover.org/cbmc/ You can see that C
474.
by jepler 10y ago
hm is this the one that won't make it to my phone, a nexus 6 (2014)? sigh.
475.
by jepler 10y ago
Yup, you're right. if you use a full size cryptographic hash then the number of undetected errors can be treated as 0 regardless of hamming distance. On the other hand, it has 8x the storage overhead of a 32-bit CRC.
476.
by jepler 10y ago
my own baseless speculation? viva64 is a known and loved site by many HN readers, while on springer I expected (but was wrong, after visiting the link) a useless paywalled academic article.
477.
by jepler 10y ago
I particularly like Linus A's contributions to the C64 demoscene, because more than likely he'll do an excellent writeup like this about a newly discovered or perfected technique that was central to it.
478.
by jepler 10y ago
Specifically, I wrote a program to search for single-bit-flip collisions in sha1 truncated to 16 bits. The program didn't need to search for long before finding two messages with the same 16-truncated sha1 with a single bit flip at b
479.
by jepler 10y ago
Less so if you assume the cryptographic hash will be truncated to 32bits so that its size matches crc32c. Furthermore, some of those collisions will be on message pairs with small hamming distance, probably including messages with a single
480.
by jepler 10y ago
"yes-ish" it is turing complete http://stackoverflow.com/questions/3136686/is-the-c99-prepro... (read the second answer, not the accepted answer)

More ›