Hacker News: fuglede_

Itsid – LLM with perfect input reproduction for e.g. license removal

fuglede_ — Wed, 01 Apr 2026 12:35:03 +0000

Article URL: https://itsid.cloud

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

Points: 2

# Comments: 0

Reducing the cost of breaking RSA-2048 to 100000 physical qubits

fuglede_ — Tue, 17 Feb 2026 19:28:12 +0000

Article URL: https://arxiv.org/abs/2602.11457

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

Points: 3

# Comments: 0

New comment by fuglede_ in "Running My Own XMPP Server"

fuglede_ — Mon, 16 Feb 2026 17:55:19 +0000

And for desktop apps, Cinny has custom emoji/sticker support. Would be nice if they played better with Element though.

New comment by fuglede_ in "Denmark's struggle to break up with Silicon Valley"

fuglede_ — Thu, 15 Jan 2026 19:09:20 +0000

Median salary for a dev is about $130,000 according to https://www.prosa.dk/raad-og-svar/loenstatistik-2025 (assumes 37 hour work week, 5 weeks of vacation).

New comment by fuglede_ in "Nvidia just paid $20B for a company that missed its revenue target by 75%"

fuglede_ — Sun, 28 Dec 2025 07:25:21 +0000

https://www.transparency.org/en/cpi/2024 offers some methodologies.

Quantum computing: too much to handle

fuglede_ — Fri, 14 Nov 2025 20:04:38 +0000

Article URL: https://scottaaronson.blog/?p=9325

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

Points: 8

# Comments: 0

Helios: A 98-qubit trapped-ion quantum computer

fuglede_ — Wed, 12 Nov 2025 11:02:46 +0000

Article URL: https://arxiv.org/abs/2511.05465

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

Points: 1

# Comments: 0

New comment by fuglede_ in "Advent of Code 2025: Number of puzzles reduce from 25 to 12 for the first time"

fuglede_ — Mon, 27 Oct 2025 06:28:55 +0000

Just to not feed the witch hunt further, note that human 30 second solve times can be entirely possible for the easiest puzzles, with enough experience, practice, and a bit of risk-taking; see e.g. https://adventofcode.com/2021/leaderboard/day/1 part 1. But the 4 second solution times we saw last year are not, no matter how you look at it.

New comment by fuglede_ in "Advent of Code 2025: Number of puzzles reduce from 25 to 12 for the first time"

fuglede_ — Mon, 27 Oct 2025 06:25:04 +0000

There's some good discussion here: https://old.reddit.com/r/adventofcode/comments/1h9cub8/discu...

But yes, you would have people openly share repositories for automatically ingesting the puzzle text, solving the puzzles, and submitting the results the moment the puzzles opened, leading to inhuman solution times. So, despite the rules stating that you can't do that, the result is that whenever the puzzles were easy enough for an LLM to solve them with high probability – and most of them are – the leaderboards would be overrun with such solutions.

In 2023, the LLMs would still struggle enough that the overall leaderboard (taking all 25 ⋅ 2 puzzles into account) would still be dominated by ordinary people (many of them recording their solutions), in 2024 that was no longer the case. Personally I would go from being able to top 100 regularly, to almost never being able to. I'm going to miss the thrill, and think it's a bit saddening that we can't have nice things, but also ultimately think that getting rid of it is the best option.

New comment by fuglede_ in "First convex polyhedron found that can't pass through itself"

fuglede_ — Sat, 25 Oct 2025 06:02:01 +0000

The triakis tetrahedron fit really is crazy close: https://youtu.be/jDTPBdxmxKw

New comment by fuglede_ in "Show HN: Swapple, a little daily puzzle on linear reversible circuit synthesis"

fuglede_ — Sat, 04 Oct 2025 08:55:07 +0000

Hm, yeah, tested it down to about 500 px width, and the low-resolution devices in Chromium but that was too optimistic then. The modals should of course be closeable, and both game boards simultaneously visible. Played around with the modals a bit, so maybe it works better now?

New comment by fuglede_ in "Show HN: Swapple, a little daily puzzle on linear reversible circuit synthesis"

fuglede_ — Tue, 30 Sep 2025 11:52:11 +0000

Yeah, the problem is in a sense solved asymptotically by the optimal construction in https://arxiv.org/abs/quant-ph/0302002, but that one tends to lead to long solutions in practice, so there's plenty of room to try to come up with solutions that give shorter solutions for concrete instances.

New comment by fuglede_ in "Show HN: Swapple, a little daily puzzle on linear reversible circuit synthesis"

fuglede_ — Tue, 30 Sep 2025 06:59:43 +0000

That's nifty! There's a lot of symmetry that can help to boil it down. For example, you actually only need row moves, and any solution with column moves can canonically be turned into one with row moves; post-composing with Ci→j is pre-composing with Rj→i.

One can think of the set of all possible board configurations as the vertices as a graph, with edges indicating how to move between configurations. Then your 1536 solutions are the 1536 distinct shortest paths between the starting and target configuration.

Then, you can also choose to consider not just board configurations, but board configurations up to simultaneous permutation of rows and columns; that will also reduce the number of unique solutions.

New comment by fuglede_ in "Show HN: Swapple, a little daily puzzle on linear reversible circuit synthesis"

fuglede_ — Mon, 29 Sep 2025 13:58:45 +0000

Thanks for sharing your thoughts!

I know of some work on trying out various heuristics for A*; Section 5 of https://arxiv.org/pdf/2201.06508 gives some examples of what works and what doesn't. I don't think D* Lite specifically has ever featured. There's plenty of room for trying to come up with other heuristics, and just for other takes in general.

> But for bigger boards you won't be able to materialize the whole graph.

If we restrict to boards corresponding to solvable puzzles, the number of vertices is https://oeis.org/A002884 (1, 1, 6, 168, 20160, 9999360, 20158709760, …) and indeed grows quickly. It's possible to manipulate the 7×7 case (https://arxiv.org/abs/2503.01467, shameless plug) but anything bigger than that seems hard.

One can ask, for example, how many moves are needed for the hardest n×n Swapple. For n = 1, …, 7 the answers are 0, 3, 6, 9, 12, 15, 18 respectively, but we don't know what the answer is for n = 8.

New comment by fuglede_ in "Show HN: Swapple, a little daily puzzle on linear reversible circuit synthesis"

fuglede_ — Mon, 29 Sep 2025 13:12:53 +0000

The confetti is currently there for when you find a shortest solution. I'd say 13 moves deserves at least a star or two, so I'll have to add that!

New comment by fuglede_ in "Show HN: Swapple, a little daily puzzle on linear reversible circuit synthesis"

fuglede_ — Mon, 29 Sep 2025 09:28:44 +0000

Heh, nice catch, I think you'll find that with a bit of work, you can make row reduction/Gaussian elimination work here as well. But that the resulting sequences of operations can get very long! One thing I personally like about the puzzle is that once you've played it for a few days, you start gaining some intuition about sequences of moves that are useful, but coming up with a good general algorithm (that also works for larger than 4x4 boards) is still a challenge.