frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Total Annihilation, rebuilt for modern computers

https://nanolathe.gg
412•jttnr•9h ago•177 comments

Whatever became of holography? (2011)

https://www.americanscientist.org/article/whatever-became-of-holography
92•cainxinth•4h ago•38 comments

Fingerprints are the new cookies

https://royfish.dev/fingerprints-are-the-new-cookies
156•royfish•5h ago•67 comments

Cartographers of North Korea (2019)

https://cartographers-nk.wonyoung.so/
205•edent•8h ago•38 comments

Calculus with Julia

https://jverzani.github.io/CalculusWithJuliaNotes.jl/
21•subset•1d ago•1 comments

Tattoos you can turn on and off

https://www.livescience.com/technology/cool-chemistry-trick-allows-new-tattoos-to-turn-on-and-off
22•MortyDev•6h ago•7 comments

The gap in shared understanding of LLM capability is widening

https://twitter.com/karpathy/status/2109361546505966046
303•albertzeyer•7h ago•487 comments

Illustration Beyond Proof

https://terrytao.wordpress.com/2026/10/11/illustration-beyond-proof/
43•smilelamp•4h ago•0 comments

Terence Tao: Math 2.0 [pdf]

https://teorth.github.io/tao-web/slides/math-2-0-caltech-2026.pdf
346•Anon84•14h ago•392 comments

Vectorized CLZ and CTZ

https://purplesyringa.moe/blog/vectorized-clz-and-ctz/
24•zX41ZdbW•1d ago•2 comments

Google is illegaly cutting forest to build data centers

https://www.theguardian.com/technology/2026/oct/06/google-datacentres-finland-temporary-halt-envi...
236•heyimada•5h ago•57 comments

Programmable pigments: Photochromic nanoparticle inks for rewritable tattoos

https://www.cell.com/matter-light/fulltext/S3117-5848(26)00119-5
34•Bluestein•18h ago•3 comments

Passkeys are a trap

https://nonfunctional.substack.com/p/passkeys-are-a-trap-do-not-use-them
375•laurex•5h ago•210 comments

Recursive self-improvement through collective intelligence

https://pub.sakana.ai/mass/
80•hardmaru•5h ago•41 comments

Chapter 1 of "Ways of Seeing" by John Berger (1972)

https://www.ways-of-seeing.com/ch1
87•rafael859•9h ago•14 comments

Doory – Open-Source Canva

https://github.com/shaongitbd/doory
19•acley•3h ago•1 comments

Local Indexing to reduce tool calling and token usage

https://tedhaley.ca/pensieve/
39•TedHaley•3h ago•5 comments

So, You’d Like To Sell Your Print Issues Of The Onion?

https://theonion.com/archivehunt/
273•mooreds•8h ago•37 comments

No portable way to detect string-to-float conversion errors in standard C

https://sebsite.pw/w/20261009-strtod.html
3•signa11•1d ago•0 comments

NYC's "Click to Cancel" rule is now in effect

https://www.nyc.gov/main/click-to-cancel
391•gregsadetsky•9h ago•192 comments

I guess I'm using WebP now?

https://anderegg.ca/2026/10/08/i-guess-im-using-webp-now
90•Brajeshwar•2d ago•90 comments

500B tokens later: Letting AI agents decompile a first-person shooter

https://momo5502.com/posts/2026-10-09-game-decompilation/
180•davikr•1d ago•127 comments

Safe SIMD in Rust, even on the inside

https://shnatsel.github.io/safe-simd-in-rust-even-on-the-inside/
49•ravenical•1d ago•2 comments

FlowCE: Calculus on your TI-84 Plus CE

https://tommyb3ll.github.io/FlowCE/
38•jgx0•1d ago•18 comments

apsw: Another Python SQLite Wrapper

https://github.com/rogerbinns/apsw
74•tosh•11h ago•15 comments

HashiCorp archives the Boundary open source repo

https://github.com/hashicorp/boundary
53•vmatsiiako•3h ago•12 comments

Show HN: BetterWispr – Free, open-source dictation for Mac

https://betterwispr.com/
170•kartik017•15h ago•98 comments

How I reverse engineered a commercial spatial audio effect

http://epestr.com/blog/reverse-engineering-a-commercial-spatial-audio-effect/
111•epestr•12h ago•34 comments

ClickHouse C – Talk to ClickHouse using its native binary protocol

https://github.com/ClickHouse/clickhouse-c
15•saisrirampur•4h ago•0 comments

Shredding JSON columns gave Logfire up to 1000x faster queries

https://pydantic.dev/articles/dynamic-shredding-2026-01-26
11•acossta•5h ago•8 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•1y ago

Comments

buildsjets•1y 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•1y 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•1y ago
(2003)
throw0101b•1y 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•1y ago
Are there any public, open, comprehensive datasets on flights?
dieselerator•1y 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•1y 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•1y 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•1y 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•1y 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/