frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Hacking OpenAI

https://www.hacktron.ai/blog/hacking-openai
213•Handy-Man•3h ago•61 comments

Waymo in Singapore

https://waymo.com/waymo-in-singapore/
73•ramanan•2h ago•45 comments

Astra for Law

https://openai.com/index/astra-for-law/
427•vertigoruntime•9h ago•456 comments

Bonsai 2 27B: Near-Lossless Compression in a 9x Smaller Footprint

https://prismml.com/news/bonsai-2-27b
355•JonSchneider•9h ago•113 comments

Jemalloc 5.4.0

https://github.com/jemalloc/jemalloc/releases/tag/5.4.0
20•gkfasdfasdf•1h ago•5 comments

The Scourge of x86 Emulation

https://fex-emu.com/Scourge-of-emulation/
24•dagmx•2h ago•0 comments

Bend – A language that blocks AI mistakes via proof, on CPU and GPU

https://bend-lang.com/
397•nicolas-siplis•9h ago•194 comments

Pre-Greek: The lost language hidden within Ancient Greek

https://linguisticdiscovery.com/posts/pre-greek/
34•axiologist•3h ago•9 comments

Hister: A private search engine for the pages you visit and the files you keep

https://github.com/asciimoo/hister
548•bookofjoe•13h ago•146 comments

Qwen 3.8 Omni Flash

https://qwen.ai/blog?id=qwen3.8-omni-flash
139•jjcm•7h ago•37 comments

Wax motor

https://en.wikipedia.org/wiki/Wax_motor
321•mhb•1d ago•61 comments

Fujitsu launches made-in-Japan next-generation CPU FUJITSU-MONAKA

https://global.fujitsu/en-global/pr/news/2026/09/14-02
556•my123•2d ago•209 comments

Shapelearn Qwen 3.8 27B (13.1 GB VRAM)

https://byteshape.com/blogs/Qwen3.8-27B/
36•syntaxing•4h ago•4 comments

Apple detectives solved mystery of ancient tree and rewrote the history of fruit

https://www.scientificamerican.com/article/how-apple-detectives-solved-the-mystery-of-an-ancient-...
26•nkurz•1d ago•2 comments

Telstra outage: The night a network decided the year was 2006

https://www.netnod.se/blog/telstra-outage-night-network-decided-year-was-2006
39•TMWNN•5h ago•13 comments

How to Write with an LLM

https://sockpuppet.org/blog/2026/09/17/how-to-write-with-an-llm/
94•joeriddles•8h ago•66 comments

Flet 1.0 – Build cross-platform apps in Python

https://flet.dev/
89•absqueued•9h ago•41 comments

Ask A Monk – A digital wilderness for thoughts with no immediate answer

https://askamonk.online
25•13613288957•4h ago•13 comments

Diplodocus, Long Thought Exclusively American, Turns Up in Spain

https://www.sci.news/paleontology/spanish-diplodocus-15064.html
54•embedding-shape•2d ago•32 comments

Khipu (Quipu) Field Guide

https://www.khipufieldguide.com/
7•SanjayMehta•2d ago•0 comments

The most important product decision is what you don't build

https://liamnugent.me/posts/what-you-dont-build/
82•ChrisArchitect•9h ago•26 comments

How Uber Protects Against Retry Storms

https://www.uber.com/us/en/blog/protecting-against-retry-storms/
80•iscmt•8h ago•33 comments

Code Scans

https://devin.ai/blog/introducing-code-scans
14•geoffbp•3h ago•4 comments

Why I didn’t sign the Fields medallists’ letter

https://gowers.wordpress.com/2026/09/17/why-i-didnt-sign-the-fields-medallists-letter/
236•simianwords•21h ago•339 comments

CrowdSec Source Code Leak

https://www.crowdsec.net/blog/crowdsec-statement-source-code-exposure
144•eccgecko•14h ago•43 comments

Speeding up gearhash on ARM64 (2× faster)

https://sam.dev/blog/gearhash-on-arm64
3•pranitha_m•2d ago•0 comments

How do we prevent mathemathics from devolving into the Medieval Era of secrecy?

https://mathoverflow.net/questions/515260/how-do-we-prevent-mathematics-from-devolving-into-the-m...
102•jjgreen•2d ago•83 comments

Infinite-Parameter LLMs: Generating and Adapting Weights from Live Data

https://arxiv.org/abs/2609.18842
133•Betelbuddy•13h ago•38 comments

Show HN: Snapdrop: Instantly share files between devices. No setup, no signup

https://snapdrop.me
60•Capira•9h ago•30 comments

The American Religion of Self-Storage Facilities

https://www.newyorker.com/magazine/2026/09/21/the-american-religion-of-self-storage-facilities
222•pseudolus•17h ago•365 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/