frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Om Malik has died

https://om.co/2026/06/24/1966-2026/
736•minimaxir•9h ago•75 comments

An entire Herculaneum scroll has been read for the first time

https://scrollprize.org/firstscroll
1155•verditelabs•14h ago•240 comments

Libre Barcode Project

https://graphicore.github.io/librebarcode/
68•luu•2h ago•3 comments

Framework's 10G Ethernet module exposes USB-C's complexity

https://www.jeffgeerling.com/blog/2026/framework-10g-ethernet-module-usb-c-complexity/
116•Alupis•4h ago•49 comments

What happened after 2k people tried to hack my AI assistant

https://www.fernandoi.cl/posts/hackmyclaw/
66•cuchoi•3h ago•15 comments

The 'papers, please' era of the internet will decimate your privacy

https://expression.fire.org/p/the-papers-please-era-of-the-internet
574•bilsbie•8h ago•256 comments

The Garbage Collection Handbook: The Art of Automatic Memory Management (2nd Ed) (2023)

https://gchandbook.org/
100•teleforce•6h ago•12 comments

Apple to skip high-end M6 Mac chips in favor of AI-focused M7 line

https://www.bloomberg.com/news/articles/2026-06-25/apple-to-skip-high-end-m6-mac-chips-to-launch-...
189•scrlk•12h ago•153 comments

Overfitted a 900KB Transformer to Compress a 100MB CSV into 7MB

78•spidy__•2d ago•38 comments

A game where you're an OS and have to manage processes, memory and I/O events

https://github.com/plbrault/youre-the-os
151•exploraz•2d ago•27 comments

Oxide computer 3D rack guided tour

https://explorer.oxide.computer/
342•darthcloud•3d ago•130 comments

Un-0: Generating Images with Coupled Oscillators

https://unconv.ai/blog/introducing-un-0-generating-images-with-coupled-oscillators/
134•babelfish•9h ago•32 comments

IBM debuts sub-1 nanometer chip technology

https://newsroom.ibm.com/2026-06-25-ibm-debuts-worlds-first-sub-1-nanometer-chip-technology
293•porridgeraisin•14h ago•161 comments

Show HN: OpenKnowledge – open source AI-first alternative to Obsidian/Notion

https://github.com/inkeep/open-knowledge
245•engomez•13h ago•119 comments

Eyewitness at the Triangle (1911)

http://trianglefire.ilr.cornell.edu/index.html
18•NaOH•3d ago•1 comments

The Doorman's Fallacy in action

https://rozumem.xyz/posts/17
89•rozumem•10h ago•121 comments

An oral history of Bank Python (2021)

https://calpaterson.com/bank-python.html
94•tosh•9h ago•28 comments

Show HN: Chess-Inspired Roguelike

https://princechazz.com
253•cowboy_henk•4d ago•83 comments

Parallel Parentheses Matching

https://williamdue.github.io/blog/parallel-parentheses-matching
75•Athas•9h ago•11 comments

OS9Map

https://yllan.org/software/OS9Map/
211•LaSombra•15h ago•40 comments

Doing a masters while working in Spain

https://jan-herlyn.com/blog/doing-a-masters-while-working/
22•MHard•3d ago•4 comments

Apple raises prices of MacBooks, iPads

https://www.reuters.com/world/asia-pacific/apple-raises-prices-macbooks-ipads-memory-costs-skyroc...
683•virgildotcodes•16h ago•987 comments

Zig's new bitCast semantics and LLVM back end improvements

https://ziglang.org/devlog/2026/#2026-06-25
224•kouosi•15h ago•111 comments

Record type inference for dummies

http://haskellforall.com/2026/06/record-type-inference-for-dummies
29•g0xA52A2A•2d ago•1 comments

Experiments in Sports Seismology for the World Cup

https://pnsn.org/blog/experiments-in-sports-seismology-for-the-world-cup
17•jmward01•4d ago•0 comments

The last Romans are still around

https://signoregalilei.com/2026/06/20/the-last-romans-are-still-around/
67•surprisetalk•3d ago•79 comments

Besimple AI (YC P25) Is Hiring

https://www.ycombinator.com/companies/besimple-ai/jobs/yWfhhOR-strategic-projects-lead-audio-data
1•yzhong94•13h ago

You can't unit test for taste

https://dev.karltryggvason.com/you-cant-unit-test-for-taste/
263•kalli•1d ago•120 comments

Hey Nico, you didn't vibe code your data room but stole it from Papermark

https://twitter.com/mfts0/status/2070080422482977095
251•mmunj•17h ago•102 comments

The disappearance of Japan's animators

https://economist.com/interactive/1843/2026/06/19/the-strange-disappearance-of-japans-animators
164•andsoitis•4d ago•121 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/