frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Gemini 3.7 Flash

https://blog.google/innovation-and-ai/models-and-research/gemini-models/introducing-gemini-3-7-fl...
475•thisisauserid•4h ago•288 comments

Accelerating GPT-5.6 Sol Ultrafast

https://www.cerebras.ai/blog/accelerating-gpt-5-6-sol-ultrafast-with-openai
300•pr337h4m•3h ago•117 comments

NP-Overrated

https://gruhn.me/blog/2026-08-13/
66•theanonymousone•1h ago•20 comments

Donkey.bas is 45 Years Old – 131 line of Glory

https://donkeybas.com/
143•jkrauska•4h ago•58 comments

Mistral OCR 4.1

https://docs.mistral.ai/models/ocr-4-1
201•spelk•4h ago•75 comments

Spaghettifying DRAM

https://github.com/xoreaxeaxeax/skitter-creek-bath-salts
431•matt_d•7h ago•130 comments

Choose Boring Technology (2015)

https://mcfunley.com/choose-boring-technology
174•tosh•3h ago•89 comments

How Gödel's Proof Works (2020)

https://www.quantamagazine.org/how-godels-proof-works-20200714/
40•tzury•2h ago•21 comments

Understanding is the new bottleneck

https://www.geoffreylitt.com/2026/07/02/understanding-is-the-new-bottleneck
79•sebg•3h ago•50 comments

How Organizations Use AI: Evidence from ChatGPT [pdf]

https://cdn.openai.com/pdf/how-organizations-use-chatgpt.pdf
31•malshe•2h ago•14 comments

How Compaction Works in Pi

https://earendil.com/posts/compaction-in-pi/
48•tosh•3h ago•7 comments

Idol Mahjong Final Romance: A Slideshow Disguised as a Video Game

https://nicole.express/2026/more-like-idle-mahjong.html
27•nicole_express•3d ago•1 comments

Nine PBS sues Iron Mountain over blocked access to archival data

https://current.org/2026/08/nine-pbs-sues-iron-mountain-over-blocked-access-to-archival-data/
158•vinayakborkar•8h ago•77 comments

Kubernetes on Oxide: How customer needs shaped our integrations

https://oxide.computer/blog/kubernetes-on-oxide
133•stevehipwell•7h ago•60 comments

Tocharian Online

https://lrc.la.utexas.edu/eieol/tokol/0
45•Bluestein•4h ago•6 comments

Launch HN: Bullet (YC S26) – A Faster Coding Agent

https://www.codewithbullet.com
66•adi1•13h ago•39 comments

DeepSeek Harness developer preview

https://deepseek.com/harness/en/
507•bjin•8h ago•229 comments

AI At Home Part 1: A Box Of Scraps

https://jdagostino.github.io/ai-pt1-box-o-scraps/index.html
68•timmmmmmay•5h ago•35 comments

Where did the old web go? We followed 657,607 links to find out

https://0.mk/blog/link-rot
94•tdx•3h ago•62 comments

Come for ENIAC, Stay for UNIVAC and Skeduflo

https://uniqueatpenn.wordpress.com/2026/08/05/come-for-eniac-stay-for-univac-and-skeduflo/
55•cainxinth•2d ago•18 comments

Smooth Move: Taming Trajectories with Polynomials

https://nick.zoic.org/art/smooth-move-taming-trajectories-with-polynomials/
7•lioeters•3d ago•0 comments

Gloomberb

https://gloom.sh/
353•rbanffy•7h ago•179 comments

Codex in ChatGPT desktop app for Linux is now in preview

https://community.openai.com/t/codex-in-chatgpt-desktop-app-for-linux-is-now-in-preview/1390027
436•allanrbo•16h ago•294 comments

Choosing an AI model: one prompt, 11 models, different results

https://www.netlify.com/blog/one-prompt-11-models-very-different-results/
157•toddmorey•8h ago•67 comments

How art invented humanity

https://aeon.co/essays/humans-did-not-invent-art-it-was-the-other-way-around
72•prismatic•23h ago•22 comments

ATG (YC F25) Is Hiring Member of Technical Staff (Data Platform)

https://atg.science/careers
1•dkobran•9h ago

I built a 500k-domain search engine for makers in a weekend for $10

https://alexmorleyfinch.github.io/marlin/history/v1/article/the_birth.html
123•dreamforever•8h ago•68 comments

Single log line is 49KB+ (ext4) / 110KB+ (btrfs) of systemd-journald disk writes

https://github.com/systemd/systemd/issues/40262
95•ValdikSS•3h ago•48 comments

JDK 27 G1/Parallel/Serial GC Changes

https://tschatzl.github.io/2026/08/10/jdk27-g1-serial-parallel-gc-changes.html
33•0x54MUR41•4h ago•11 comments

Ordinary abundance

https://ordinaryabundance.com/
173•yen223•8h ago•92 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/