Hacker News: judicious

New comment by judicious in "Simons Foundation launches $15M effort to help mathematicians navigate AI era"

judicious — Fri, 16 Oct 2026 03:07:59 +0000

I do seeing this becoming a trend more and more. A lot of open models are fairly strong and fine-tuning and other post-training techniques could easily make bespoke domain-specific inference considerably cheaper (in token usage and energy consumption) and allow for more data sovereignty.

New comment by judicious in "Ask HN: What are you reading?"

judicious — Tue, 29 Sep 2026 15:49:42 +0000

Blank Space: A Cultural History of the Twenty-First Century by W. David Marx. A fascinating and approachable read.

Intern Spotlight: 2025 Software Engineering Summer Projects

judicious — Sun, 30 Aug 2026 18:12:45 +0000

Article URL: https://www.hudsonrivertrading.com/hrtbeat/intern-spotlight-2025-software-engineering-summer-projects/

Comments URL: https://news.ycombinator.com/item?id=49501231

Points: 3

# Comments: 0

Cheap Ornament and Status Games

judicious — Fri, 16 Jan 2026 19:42:06 +0000

Article URL: https://worksinprogress.co/issue/cheap-ornament-and-status-games/

Comments URL: https://news.ycombinator.com/item?id=46651148

Points: 1

# Comments: 0

Euergetism

judicious — Fri, 16 Jan 2026 19:29:00 +0000

Article URL: https://en.wikipedia.org/wiki/Euergetism

Comments URL: https://news.ycombinator.com/item?id=46650961

Points: 3

# Comments: 0

Build Systems Are Spreadsheets

judicious — Fri, 05 Dec 2025 04:49:58 +0000

Article URL: https://functional.computer/blog/build-systems-are-spreadsheets

Comments URL: https://news.ycombinator.com/item?id=46156944

Points: 1

# Comments: 0

Rain: A key-value store for Strava's scale

judicious — Sun, 02 Nov 2025 00:23:19 +0000

Article URL: https://medium.com/strava-engineering/rain-a-key-value-store-for-stravas-scale-7f580f5b4848

Comments URL: https://news.ycombinator.com/item?id=45786795

Points: 2

# Comments: 0

New comment by judicious in "The Weird Concept of Branchless Programming"

judicious — Sun, 28 Sep 2025 20:47:55 +0000

I’m by no means an expert on this topic, but what about using predefined hash map of value to function call/closure unless that also yields branched programming underneath? Additionally, maybe you want to use macros of some kind to generate the “magic” function you’re looking for, where it constructs a single branchless statement up to N terms, whether it’s procedural macros in Rust or C macros.

The Weird Concept of Branchless Programming

judicious — Sun, 28 Sep 2025 16:40:53 +0000

Article URL: https://sanixdk.xyz/blogs/the-weird-concept-of-branchless-programming

Comments URL: https://news.ycombinator.com/item?id=45405750

Points: 170

# Comments: 90

I learned to stop worrying and love the debt

judicious — Fri, 26 Sep 2025 15:20:27 +0000

Article URL: https://worksinprogress.co/issue/how-i-learned-to-stop-worrying-and-love-the-debt/

Comments URL: https://news.ycombinator.com/item?id=45387526

Points: 1

# Comments: 1

What if Humanity forgot how to make CPUs? [video]

judicious — Thu, 25 Sep 2025 17:37:32 +0000

Article URL: https://www.youtube.com/watch?v=L2OJFqs8bUk

Comments URL: https://news.ycombinator.com/item?id=45376124

Points: 2

# Comments: 0

Class Based Programming Sucks

judicious — Sat, 12 Oct 2024 18:06:27 +0000

Article URL: https://loup-vaillant.fr/articles/classes-suck

Comments URL: https://news.ycombinator.com/item?id=41821083

Points: 4

# Comments: 1

New comment by judicious in "Turkish language has a gossip tense"

judicious — Sat, 12 Oct 2024 17:34:36 +0000

Something like this occurs cross-linguistically: https://en.wikipedia.org/wiki/Evidentiality

Turkish has some evidentiality.

New comment by judicious in "Snapshot Testing for the Masses"

judicious — Tue, 08 Oct 2024 23:54:57 +0000

Here's a link to their library in GitHub: https://github.com/tigerbeetle/tigerbeetle/blob/588123f219f1...

Snapshot Testing for the Masses

judicious — Tue, 08 Oct 2024 23:14:50 +0000

Article URL: https://tigerbeetle.com/blog/2024-05-14-snapshot-testing-for-the-masses

Comments URL: https://news.ycombinator.com/item?id=41782772

Points: 2

# Comments: 1

New comment by judicious in "Lesser known parts of Python standard library"

judicious — Thu, 05 Sep 2024 19:03:26 +0000

That's incredibly clever, generators are underrated. I once challenged my friend to do leetcode problems with only expressions. Here's levenshtein distance, however it's incredibly clunky.

  levenshtein_distance = lambda s1, s2: [matrix := [[0] * (len(s2) + 1) for _ in 
  range(len(s1) + 1)], [
          [
              (matrix[i].__setitem__(j, min(matrix[i-1][j] + 1, matrix[i][j-1] + 
  1, matrix[i-1][j-1] + (0 if s1[i-1] == s2[j-1] else 1))), matrix[i][-1])[1]
              for j in range(1, len(s2) + 1)
         ]
         for i in range(1, len(s1) + 1)
     ], matrix[-1][-1]][-1]

New comment by judicious in "Lesser known parts of Python standard library"

judicious — Thu, 05 Sep 2024 18:24:25 +0000

I guess for most purposes, OrderedDicts are then obsolete, but I believe there are some extra convenience methods that they have, but I've only really needed to preserve order.

Makes you think what other parts of Python have become obsolete.

New comment by judicious in "Lesser known parts of Python standard library"

judicious — Thu, 05 Sep 2024 18:11:45 +0000

I find converting things from map objects or filter objects back to lists to be a bit clunky. Not to mention chaining operations makes it even more clunky. Some syntatic sugar would go a long way.

New comment by judicious in "Lesser known parts of Python standard library"

judicious — Thu, 05 Sep 2024 15:04:22 +0000

Dictionary comprehensions can be very elegant. List and dictionary comprehensions are very powerful and expressive abstractions. In fact, while not good practice you can pretty much write all Python code inside comprehensions including stuff regarding mutation.

This is valid(as in it will run, but highly unidiomatic) code:

quicksort = lambda arr: [pivot:=arr[0], left:= [x for x in arr[1:] if x < pivot], right := [x for x in arr[1:] if x >= pivot], quicksort(left) + [pivot] + quicksort(right)][-1] if len(arr) > 1 else arr

print(quicksort([1, 33, -4, -2, 110, 5, 88]))

New comment by judicious in "Lesser known parts of Python standard library"

judicious — Thu, 05 Sep 2024 04:10:28 +0000

There in lies another reason why OrderedDicts are still useful even in 3.12