This one is pretty easy to counter. Just ask the person to hand you their phone and go through their messages and photos. There's no one that wouldn't feel restless about it.
908 karma · joined March 13, 2024
This one is pretty easy to counter. Just ask the person to hand you their phone and go through their messages and photos. There's no one that wouldn't feel restless about it.
Functional languages like ML/Haskell/Lisp dialects has no lies built in for decades, and it's good to see the mainstream programming (Java, TS, C++, etc.) to catch up as well.
There are also cute benefits of having strong schemas for your API as well -- for example, that endpoint becomes an MCP for LLMs automatically.
For context, a number is transcendental if it's not the root of any non-zero polynomial with rational coefficients. Essentially, it means the number cannot be constructed using a finite combination of integers and standard algebraic operations (addition, subtraction, multiplication, division, and integer roots). sqrt(2) is irrational but algebraic (it solves x^2 - 2 = 0); pi is transcendental.
The reason we haven't been able to prove this for constants like Euler-Mascheroni (gamma) is that we currently lack the tools to even prove they are irrational. With numbers like e or pi, we found infinite series or continued fraction representations that allowed us to prove they cannot be expressed as a ratio of two integers.
With gamma, we have no such "hook." It appears in many places (harmonics, gamma function derivatives), but we haven't found a relationship that forces a contradiction if we assume it is algebraic. For all we know right now, gamma could technically be a rational fraction with a denominator larger than the number of atoms in the universe, though most mathematicians would bet the house against it.
> "A bad design with a good presentation is doomed eventually. A good design with a bad presentation is doomed immediately."
Hopefully your API doesn't get exploited and you are doing timeouts/sandboxing -- it'd be easy to do a massive join on this.
I also have a question mostly stemming from me being not knowledgeable in the area -- have you noticed any semantic bleeding when research is done between your datasets? e.g., "optimization" probably means different things under ArXiv, LessWrong, and HN. Wondering if vector searches account for this given a more specific question.
For smaller code bases, I usually read the repo first and I'm able to learn what exists while working through it.
VS Code's heavy reliance on the file explorer tree forces you to constantly visually scan nested directories to navigate. When I switched to Neovim (with Telescope/jump lists), I moved from visual scanning to mental mapping. I don't look for where a file is; I type what the file is. It sounds subtle, but removing that micro-latency of "eye-to-mouse-to-tree" keeps you in the flow state much longer.
In reality, the cost of video production dropped to near-zero (smartphones, TikTok, YouTube). However, he was right about the outcome. The "entry barrier" isn't the cost of the camera, it's the cost of the algorithmic optimization and the "strategies to draw attention" in an information glut. The rich didn't win because video is expensive; they won because virality is gameable with resources. Credits where due, he indeed called out this potential for "international manipulation of domestic politics" well before the major scandals of the 2016 era.
This probably makes a lot of money for Vercel and Cloudflare.
I was timestamping everything using steady_clock to strictly enforce the time limits, and then just applied a calculated offset to convert that to wall time for the "Submission Date" display. It worked in testing, but during a long stress-test session, my laptop did an NTP sync. The logs then showed submissions appearing to happen before the source code file was last modified, which confused the caching logic. I was essentially betting that system_clock was stable relative to steady_clock over the process lifetime.
I eventually refactored to exactly what the article suggests: use steady_clock strictly for the runtime enforcement (is duration < 2.0s?), but capture system_clock::now() explicitly at the submission boundary for the logs, rather than trying to do math on the steady timestamp.
Also, +1 for std::chrono::round in C++20. I’ve seen code where duration_cast was used to "round" execution times to milliseconds for display, but it was silently flooring them. In a competitive programming context, reporting 1000ms when the actual time was 1000.9ms is a misleading difference because the latter gets Time Limit Exceeded error. Explicit rounding makes the intent much clearer.
I remember trying out some of the home-made methods while I was implementing a creative work section for a school assignment. It’s surprising how "flat" the basic average looks until you actually respect the coefficients (usually some flavor of 0.21R + 0.72G + 0.07B). I bet it's even more apparent in a 4-bit display.
A fun tangent on the "green cast" mentioned in the post: the reason the Bayer pattern is RGGB (50% green) isn't just about color balance, but spatial resolution. The human eye is most sensitive to green light, so that channel effectively carries the majority of the luminance (brightness/detail) data. In many advanced demosaicing algorithms, the pipeline actually reconstructs the green channel first to get a high-resolution luminance map, and then interpolates the red/blue signals—which act more like "color difference" layers—on top of it. We can get away with this because the human visual system is much more forgiving of low-resolution color data than it is of low-resolution brightness data. It’s the same psycho-visual principle that justifies 4:2:0 chroma subsampling in video compression.
Also, for anyone interested in how deep the rabbit hole goes, looking at the source code for dcraw (or libraw) is a rite of passage. It’s impressive how many edge cases exist just to interpret the "raw" voltages from different sensor manufacturers.
FWIW, I also have had also success with running a server-side headless chromium instance on an app where I was generating nicely formatted exam from provided questions.
[0] https://barish.me/blog/make-your-website-printable-with-css/
Source code and playground here: https://github.com/BarishNamazov/gsql/
Background blog here: https://barish.me/blog/parametric-polymorphism-for-sql/
Feedback is super appreciated!