frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Mesh LLM: distributed AI computing on iroh

https://www.iroh.computer/blog/mesh-llm
133•tionis•4h ago•32 comments

We Know Simple Fluids Can Flow. Turns Out, Some Can Fracture

https://www.quantamagazine.org/we-know-simple-fluids-can-flow-turns-out-some-can-fracture-20260710/
22•Anon84•1h ago•1 comments

A pure scheme web programming tool

https://goeteia.dev
29•guenchi•2h ago•13 comments

Show HN: Ant – A JavaScript runtime and ecosystem

https://antjs.org
202•theMackabu•7h ago•86 comments

RISCBoy is an open-source portable games console, designed from scratch

https://github.com/Wren6991/RISCBoy
74•mariuz•5h ago•17 comments

I Did Not Kill Stanley Lieber: How to Draw (With 9front)

https://triapul.cz/automa/i_did_not_kill_stanley_lieber
22•c-c-c-c-c•2d ago•2 comments

A dock that wakes up reliably

https://fabiensanglard.net/tb4/index.html
39•ingve•2h ago•29 comments

The Energetic Costs of Cellular Computation (2012)

https://arxiv.org/abs/1203.5426
8•lioeters•1h ago•0 comments

Nvidia, CoreWeave, and Nebius: Inside the Circular Financing of the GPU Boom

https://io-fund.com/ai-stocks/nvidia-coreweave-nebius-circular-financing-gpu-boom
178•adletbalzhanov•10h ago•59 comments

A Erlang style pure Scheme Webserver and further

https://igropyr.com
12•guenchi•2h ago•1 comments

Billions of Sketches Reveal Hidden Cultural Variation in Human Concepts

https://arxiv.org/abs/2607.07267
63•Anon84•2d ago•8 comments

We scaled PgBouncer to 4x throughput

https://clickhouse.com/blog/pgbouncer-clickhouse-managed-postgres
185•saisrirampur•12h ago•38 comments

UPI: Anatomy of a Payment Transaction

https://timeseriesofindia.com/economy/reads/upi-architecture/
120•prtk25•11h ago•43 comments

What xAI's Grok Build CLI Actually Sends to xAI

https://gist.github.com/cereblab/dc9a40bc26120f4540e4e09b75ffb547
89•jhoho•2h ago•47 comments

Show HN: Quantum-Qec / Matrix-Free Quantum Homeostatic Engine(Blueprint)

https://github.com/PJHkorea/quantum-mesh-qec
3•PJHkorea•1h ago•1 comments

Jellyfish Undersea Roundabout

https://visitfaroeislands.com/en/plan-your-stay/getting-around/world-first-under-sea-roundabout
7•hydrogen7800•3d ago•0 comments

An agent in 100 lines of Lisp

https://thebeach.dev/posts/lisp-agent/
48•jamiebeach•4d ago•0 comments

The early History of the Singular Value Decomposition (1993) [pdf]

https://www.math.ucdavis.edu/~saito/courses/229A/stewart-svd.pdf
97•wolfi1•12h ago•60 comments

Prefer strict tables in SQLite

https://evanhahn.com/prefer-strict-tables-in-sqlite/
236•ingve•10h ago•116 comments

Long Covid May Physically Damage the Nerves That Control the Stomach

https://www.ijidonline.com/article/S1201-9712(26)00608-9/fulltext
60•thenerdhead•3h ago•33 comments

Biff.graph: structure your Clojure codebase as a queryable graph

https://github.com/jacobobryant/biff/tree/v2.x/libs/graph
91•jacobobryant•4d ago•8 comments

Optimization Solver as a Service

https://www.quicopt.com/developer/getting-started/
21•paddi91•3d ago•12 comments

Show HN: Learn by rebuilding Redis, Git, a database from scratch

https://shipthatcode.com
136•acley•13h ago•39 comments

Show HN: Sqlsure – deterministic semantic checks for AI-generated SQL

https://github.com/sqlsure/sqlsure
23•tejusarora•7h ago•3 comments

Doctors die. It's not like the rest of us, but it should be (2016)

https://archive.cancerworld.net/featured/how-doctors-die/
94•downbad_•4h ago•58 comments

Martha Lillard, last US polio patient using iron lung, dies at 78 in Oklahoma

https://abcnews.com/US/wireStory/martha-lillard-us-polio-patient-iron-lung-dies-134668491
39•daniel_iversen•3h ago•6 comments

Sixtyfour (YC P25) Is Hiring

https://www.ycombinator.com/companies/sixtyfour/jobs/bIbgQkL-operations-associate-data-samples-cu...
1•HPMOR•10h ago

How to Achieve Pruning When Querying by Non-Partitioned Columns in PostgreSQL

https://hakibenita.com/postgresql-partition-pruning
8•theanonymousone•2d ago•1 comments

ZeroFS vs. Amazon S3 Files

https://www.zerofs.net/blog/zerofs-vs-aws-s3-files/
68•cbrewster•9h ago•16 comments

Show HN: Orbit – AR satellite tracker, watch 15k+ objects

https://nagylukas.github.io/orbit.html
64•lukas9•10h ago•17 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/