frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

F3

https://github.com/future-file-format/f3
98•tosh•40m ago•22 comments

Show HN: TikZ Editor – WYSIWYG editor for figures in LaTeX

https://tikz.dev/editor/
204•DominikPeters•3h ago•36 comments

Unlimited OCR: One-Shot Long-Horizon Parsing

https://github.com/baidu/Unlimited-OCR
324•ingve•5h ago•84 comments

San Diego Photologs from the 1970s

https://www.beautifulpublicdata.com/san-diego-photologs-from-the-1970s/
15•jonathanmkeegan•38m ago•0 comments

Spying on kids to save kids from spying is stupid

https://pluralistic.net/2026/06/23/destroy-the-village/
388•hn_acker•3h ago•256 comments

Lift4D: Harmonizing Single-View 3D Estimation for 4D Reconstruction In-the-Wild

https://lift4d.github.io/
62•ilreb•2h ago•4 comments

Five monitors on a Commodore 128 [video]

https://www.youtube.com/watch?v=ul5hC3PY1Yg
32•EvanAnderson•22h ago•8 comments

Samsung Demonstrates 3D Stacked FETs with Triple Nanosheet Channels at 42nm

https://semiconductor.samsung.com/news-events/tech-blog/from-gaa-to-3d-stacked-fet-expanding-the-...
26•its_ajseven•4d ago•5 comments

Mistral OCR 4

https://mistral.ai/news/ocr-4/
255•meetpateltech•3h ago•67 comments

Show HN: Bun-sqlgen – Type-safe raw SQL for Bun, no ORM

https://github.com/ilbertt/bun-sqlgen
40•ilbert•3h ago•18 comments

Plotnine

https://plotnine.org/
205•tosh•4d ago•64 comments

MSG Made Dossier on Activists Who Opposed Facial Recognition

https://www.404media.co/madison-square-garden-made-dossier-on-activists-who-opposed-facial-recogn...
198•cdrnsf•3h ago•49 comments

Claude Tag

https://www.anthropic.com/news/introducing-claude-tag
23•adocomplete•24m ago•2 comments

Rethinking Modularity in Ruby Applications

https://noteflakes.com/articles/2026-06-18-syntropy-modules
5•ciconia•4d ago•0 comments

Show HN: Treedocs: Documentation that automatically checks for staleness

https://dandylyons.github.io/treedocs/
20•DandyLyons•2h ago•14 comments

GLM-5.2 – How to Run Locally

https://unsloth.ai/docs/models/glm-5.2
540•TechTechTech•20h ago•258 comments

Open Source for IBM Z and LinuxONE

https://community.ibm.com/community/user/blogs/elizabeth-k-joseph1/2026/06/18/linuxone-open-sourc...
28•ncruces•3d ago•5 comments

The Low-Tech AI of Elden Ring

https://nega.tv/posts/low-tech-ai-of-elden-ring.html
39•g0xA52A2A•5h ago•24 comments

80386 Early Start Memory Access

https://nand2mario.github.io/posts/2026/80386_early_start/
27•nand2mario•4h ago•1 comments

Will It Mythos?

https://swelljoe.com/post/will-it-mythos/
261•mindingnever•13h ago•194 comments

Lossless GIF recompression via exhaustive search

https://blog.arusekk.pl/posts/lossless-gif-recompression/
36•ZacnyLos•4h ago•8 comments

Pact: Anonymous Credentials for the Web

https://hacks.mozilla.org/2026/06/pact-anonymous-credentials-for-the-web/
29•kevincox•1h ago•1 comments

Researchers used math to crack Wordle

https://www.binghamton.edu/news/story/6327/s-m-a-r-t-these-researchers-used-math-to-crack-wordle
29•hhs•2d ago•37 comments

VibeThinker: 3B param model that beats Opus 4.5 on reasoning with novel SFT+GRPO

https://arxiv.org/abs/2606.16140
325•timhigins•15h ago•172 comments

Crypto in 2026: Oh, This Is the Bad Place

https://www.stephendiehl.com/posts/bad_place_2026/
324•ibobev•7h ago•404 comments

Steam Machine launches today

https://store.steampowered.com/news/group/45479024/view/685257114654870245
1832•theschwa•1d ago•1579 comments

Show HN: Neural Particle Automata

https://selforg-npa.github.io/
69•esychology•9h ago•14 comments

AI's Affordability Crisis

https://blog.dshr.org/2026/06/ais-affordability-crisis.html
150•ilreb•2h ago•192 comments

In praise of memcached

https://jchri.st/blog/in-praise-of-memcached/
246•j03b•16h ago•100 comments

Digital euro clears key hurdle as EU seeks to break free from U.S. credit cards

https://finance.yahoo.com/markets/currencies/articles/ecb-secures-key-parliamentary-backing-10271...
61•madars•1h ago•82 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/