frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

3D-Knitting: The Ultimate Guide

https://www.oliver-charles.com/pages/3d-knitting
74•ChadNauseam•2h ago•26 comments

SBCL: A Sanely-Bootstrappable Common Lisp (2008) [pdf]

https://research.gold.ac.uk/id/eprint/2336/1/sbcl.pdf
53•pabs3•4h ago•31 comments

Show HN: s@: decentralized social networking over static sites

http://satproto.org/
299•remywang•10h ago•126 comments

Returning to Rails in 2026

https://www.markround.com/blog/2026/03/05/returning-to-rails-in-2026/
149•stanislavb•5h ago•86 comments

Avoiding Trigonometry (2013)

https://iquilezles.org/articles/noacos/
30•WithinReason•2h ago•5 comments

Printf-Tac-Toe

https://github.com/carlini/printf-tac-toe
33•carlos-menezes•3d ago•4 comments

Temporal: The 9-year journey to fix time in JavaScript

https://bloomberg.github.io/js-blog/post/temporal/
694•robpalmer•19h ago•222 comments

Making WebAssembly a first-class language on the Web

https://hacks.mozilla.org/2026/02/making-webassembly-a-first-class-language-on-the-web/
573•mikece•1d ago•204 comments

Datahäxan

https://0dd.company/galleries/witches/7.html
75•akkartik•2d ago•5 comments

1B identity records exposed in ID verification data leak

https://www.aol.com/articles/1-billion-identity-records-exposed-152505381.html
48•robtherobber•1h ago•10 comments

WebPKI and You

https://blog.brycekerley.net/2026/03/08/webpki-and-you.html
63•aragilar•2d ago•5 comments

Tested: How Many Times Can a DVD±RW Be Rewritten? Methodology and Results

https://goughlui.com/2026/03/07/tested-how-many-times-can-a-dvd%C2%B1rw-be-rewritten-part-2-metho...
171•giuliomagnifico•3d ago•46 comments

I was interviewed by an AI bot for a job

https://www.theverge.com/featured-video/892850/i-was-interviewed-by-an-ai-bot-for-a-job
327•speckx•16h ago•301 comments

Dolphin Progress Release 2603

https://dolphin-emu.org/blog/2026/03/12/dolphin-progress-report-release-2603/
7•BitPirate•1h ago•0 comments

Reliable Software in the LLM Era

https://quint-lang.org/posts/llm_era
12•mempirate•2h ago•0 comments

Many SWE-bench-Passing PRs would not be merged

https://metr.org/notes/2026-03-10-many-swe-bench-passing-prs-would-not-be-merged-into-main/
244•mustaphah•14h ago•122 comments

Don't post generated/AI-edited comments. HN is for conversation between humans

https://news.ycombinator.com/newsguidelines.html#generated
3629•usefulposter•15h ago•1356 comments

NASA's DART spacecraft changed an asteroid's orbit around the sun

https://www.sciencenews.org/article/spacecraft-changed-asteroid-orbit-nasa
35•pseudolus•3d ago•14 comments

The MacBook Neo

https://daringfireball.net/2026/03/the_macbook_neo
550•etothet•23h ago•879 comments

Newcomb's Paradox Needs a Demon

https://samestep.com/blog/newcombs-paradox/
3•sestep•2d ago•0 comments

Show HN: I built a tool that watches webpages and exposes changes as RSS

https://sitespy.app
259•vkuprin•18h ago•60 comments

Google closes deal to acquire Wiz

https://www.wiz.io/blog/google-closes-deal-to-acquire-wiz
297•aldarisbm•20h ago•172 comments

BitNet: Inference framework for 1-bit LLMs

https://github.com/microsoft/BitNet
344•redm•22h ago•163 comments

Personal Computer by Perplexity

https://www.perplexity.ai/personal-computer-waitlist
164•josephwegner•16h ago•132 comments

Faster asin() was hiding in plain sight

https://16bpp.net/blog/post/faster-asin-was-hiding-in-plain-sight/
209•def-pri-pub•20h ago•115 comments

Entities enabling scientific fraud at scale (2025)

https://doi.org/10.1073/pnas.2420092122
291•peyton•21h ago•202 comments

Galaxy Zoo

https://www.zooniverse.org/projects/zookeeper/galaxy-zoo
8•mooreds•3d ago•2 comments

About memory pressure, lock contention, and Data-oriented Design

https://mnt.io/articles/about-memory-pressure-lock-contention-and-data-oriented-design/
55•vinhnx•3d ago•6 comments

Show HN: Klaus – OpenClaw on a VM, batteries included

https://klausai.com/
144•robthompson2018•19h ago•84 comments

5,200 holes carved into a Peruvian mountain left by an ancient economy

https://newatlas.com/environment/5-200-holes-peruvian-mountain/
128•defrost•2d ago•66 comments
Open in hackernews

Computational Complexity of Air Travel Planning [pdf] (2003)

http://www.demarcken.org/carl/papers/ITA-software-travel-complexity/ITA-software-travel-complexity.pdf
76•rochoa•10mo ago

Comments

buildsjets•10mo ago
This is well over 20 years old and is based on pre 9/11 flight data. I would suspect that a lot has changed since then. So proceed with no caution at all.
gwern•10mo ago
Since these sorts of things usually only get more and more complex over time, I would guess that it's all still true, but much more so.
throw0101b•10mo ago
(2003)
throw0101b•10mo ago
The PDF was produced by ITA, which famously used Common Lisp:

* https://en.wikipedia.org/wiki/ITA_Software

From 2001, a message from the same author as the linked paper:

> (Here's an email Carl de Marcken of ITA Software sent to a friend, describing their experiences using Lisp in one of the software industry's most demanding applications.)

* https://www.paulgraham.com/carl.html

Qem•10mo ago
Are there any public, open, comprehensive datasets on flights?
dieselerator•10mo ago
> Are there any public, open, comprehensive datasets on flights?

Airlines and commercial aviation operators schedule their own flights. That is a dynamic schedulle. So, perhaps there is no "comprehensive data set".

However, FlightAware makes publicly available scheduled and completed flight data over many routes in the USA. You can search by route and get a list of flights.

Flight information includes filed departure time, route of flight, and speed. For completed flights actual time, altitude, and route is shown. For example, a search on the route Dallas/Fort Worth to Austin lists 45 flights.

I hope that helps.

foundart•10mo ago
A very interesting dive into, as the title says, the computational complexity of air travel planning. Graph algorithms with lots of complexity added due to the wide variety of fare conditions that airlines have dreamt up over the years.

The article may be from 2003 but I would call it an evergreen. While I imagine some of the details have changed since then, I suspect that the complexity has only grown since then.

foundart•10mo ago
It makes me wonder: Would an airline that drastically simplified its fares be more likely to appear in flight search results?

Simplifying the fares would make it less computationally expensive and, in theory, could take fewer steps to answer a flight planning query.

Imagine a flight search planner that, say, fanned out N airline-specific workers when handling a planning query and then displayed to the user whatever results it got back within some time limit. If FooAir had simple fares, the FooAir searcher would likely run faster than searchers for other airlines. Thus it would be more likely to return results for more queries, assuming the deadline is fairly tight because of usability metrics. (People don't tend to stick around waiting for slow results.)

sjburt•10mo ago
At least a few years ago (~2014), the fare search was actually nearly instant, but all major airfare search sites added a delay because customers had the impression they were getting a better deal when they had to wait. It seems like the delay has been dialed back lately.
teleforce•10mo ago
This is a very popular article that get submitted every now and then (nearly every year) [1].

I think this kind of problem would be a very nice for logic, optimization and constraint programming that probably can be solved with modern tools like Google OR-Tool or Monash University MiniZinc [1],[2],[3].

[1] Past:

https://hn.algolia.com/?query=Computational%20Complexity%20o...

[2] Logic, Optimization, and Constraint Programming: A Fruitful Collaboration - John Hooker - CMU (2023) [video]:

https://www.youtube.com/live/TknN8fCQvRk

[3] Google OR-Tools:

https://developers.google.com/optimization

[4] MiniZinc:

https://www.minizinc.org/