jepler

8 ms·

31.
by jepler 2y ago
Put the question another way: Suppose you want to determine the moment of midnight to within 0.5s without using any clock more accurate than counting the number of days. You are, however, allowed to use telescopes, reference materials and p
32.
by jepler 2y ago
I appreciate the explanation!
33.
by jepler 2y ago
did you consider using io_uring? if not, was there a reason other than portability?
34.
by jepler 2y ago
A setting to go and change when you install the latest firefox.
35.
by jepler 2y ago
The author of this site usually takes pains to obfuscate whatever big commercial entity she's talking about who did dumb stuff. But when it's Firefox, she names names. Huh.
36.
by jepler 2y ago
you could convert the STEP file to STL just for the purposes of this tool, it looks like you have to apply the resulting rotation manually in your slicer anyway using the rotate tool.
37.
by jepler 2y ago
because the key problem with Amazon is that the consistently high-quality items are priced accordingly.
38.
by jepler 2y ago
I didn't read it in detail but I did find this version of the same anecdote followed by a commentary on the original ROM code: http://wg20.criticalcodestudies.com/index.php?p=/discussion/... the underlying al
39.
by jepler 2y ago
As far as I understand it, the amount of a bitcoin transaction is in uint64_t satoshis. In a correct implementation, all arithmetic performed on integers is exact, and there's no possibility for the number of satoshis in any transactio
40.
by jepler 2y ago
arc support may exist but be poor. For example, I recently read prusa's documentation, which states "[G2 and G3 controlled arc move] commands don't propperly work with MBL enabled. The compensation only happens at the end of
41.
by jepler 2y ago
I don't know what compiler & flags they ran it on, but with gcc 12's preprocessor it looks much more than that: include files nest to a level of 200 before an error by default. with `-fmax-include-depth=10`, about 200kB of err
42.
by jepler 2y ago
I was curious how linux's clock_gettime compared. I wrote a simple program that tried all the clock types documented in my manpage: https://gist.github.com/jepler/e37be8fc27d6fb77eb6e9746014db... My two handy syst
43.
by jepler 2y ago
This is a newly published paper ( https://iopscience.iop.org/article/10.3847/2041-8213/ad3828/... ) but it concerns observations made in 2021. i.e., it's new analysis of old data.
44.
by jepler 2y ago
Exciting: the possibility of alien life Also exciting: Our ability to observe exoplanets, and our scientists efforts to create models that glean useful information from those observations. From what I can glean in some short searching, the
45.
by jepler 2y ago
I think there's a core of a good esolang idea here for sure. I struggled with the difficulty of getting any program to work, due to the multiple layers (note names to key names), inability to inspect the interpreter state, lack of a re
46.
by jepler 3y ago
What I think you're overlooking here is the requirement that the data part also be "url-safe". If this requiement was not present, you'd be right that the binary encoding is better ("100% efficient") url-safe d
47.
by jepler 3y ago
Yes, that is a file with zero lines that ends with an "incomplete line". Processing of such files by standard line-oriented utilities is undefined in the opengroup spec. So, for instance, the effect of "grep"ping such a
48.
by jepler 3y ago
Maybe some other PCRE-compatible implementation offers streaming. For instance, https://www.intel.com/content/www/us/en/developer/articles/t... says it has this feature, but of course given who
49.
by jepler 3y ago
A dead CMOS battery entirely stops a computer from booting at all these days? Yikes.
50.
by jepler 3y ago
instead of encoding "moved king", encode "moved rook" on each rook. Since a pawn can never be on its home rank, overlap rook (not moved) & pawn (en passant) codes. Now you have a code for "king (to move)" a
51.
by jepler 3y ago
My impression is that RSA was covered by patent (from 1983 until 2001). DSA was attractive in part because, while patented, the primary patent was held by the US government and royalty-free. I have vague memories (from circa 1995 comp sci u
52.
by jepler 3y ago
I still used spambayes up until I basically abandoned my self-hosted e-mail setup (in favor of an @gmail). It occurred to me recently that LLM-style tokenization + bayesian classification would be a sweet upgrade for spambayes, which always
53.
by jepler 3y ago
Interesting that the log 7 case is called out as tricky in that linked PDF..
54.
by jepler 3y ago
Author seems to have built 5 systems from 2016 to 2023, or around every other year. Some parts (e.g., RAM) are re-used across multiple builds It's interesting to wonder: How much $$ is the hardware cost vs the lifetime energy costs? Is
55.
by jepler 3y ago
google fi has several usage plans. they all appear to switch you to a slower data speed based on a data cap. See https://fi.google.com/about/plans?selectedplan=4&pli=1#compa... the highest plan, "unlimited plu
56.
by jepler 3y ago
There are better strategies for returning random numbers in a range, in terms of the fraction of values that will be rejected. The code shown here recognizes the problem (the example of generating numbers from 0 to 25 inclusive) and finds a
57.
by jepler 3y ago
It's funny you should say this. Reading this article prompted me to future-proof a program I maintain for fun that deals with time; it had one use of utcnow, which I fixed. And then I tripped over a runtime type problem in an unrelated
58.
by jepler 3y ago
If you have to design for pathological workloads, absolutely you can write to a location in main memory 30 times per millisecond. Lots of non-pathological workloads might write to a memory location every millisecond, such as a game with a
59.
by jepler 3y ago
yeah I'd kinda talked myself out of it the idea the end of my own post.
60.
by jepler 3y ago
A base 8 or 16 version of this might be useful for calculating products on old CPUs without a multiply instruction, without having unreasonably large tables. One table driven way of accelerating 8×8 bit multiplication with a table of modest

More ›