frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Frostbite: A new CPU architecture discovered, designed and verified by AI

https://architectlabs.com/blog/frostbite
198•shioyama•2h ago•127 comments

If you can't explain something in simple terms, you don't understand it (2017)

https://kottke.org/17/06/if-you-cant-explain-something-in-simple-terms-you-dont-understand-it
99•sammatilda•3h ago•59 comments

The Making of Oxygene

https://jeanmicheljarre.com/aaa/the-making-of-oxygene
51•hggh•2h ago•16 comments

OpenSSL: Buffer overflow in EVP_EncodeBlock() (CVE-2026-121481, CVSS 9.8)

https://github.com/openssl/openssl/pull/33652
294•JacobHenner•10h ago•228 comments

Show HN: Fast deterministic natural language search for OpenStreetMap data

https://hippomaps.ch/?q=cafes+by+the+Limmat+100+m+from+the+lake+in+zurich#map=15.02/47.36708/8.54935
9•vihren•21h ago•0 comments

Carnival Cruises emits ten times more sulphur oxide than all of Europe's cars (2019)

https://ecohustler.com/article/one-corporation-to-pollute-them-all/
204•sammatilda•3h ago•98 comments

What people are building, discovered through new domains

https://startups.novumsignals.com/
34•walterschnitzel•2h ago•14 comments

Show HN: Tinnitus frequency finder and audio notch tool

https://trynotched.com/find
43•brianrhea•2d ago•21 comments

The Strongest Sokoban Solver

https://healeycodes.com/introducing-the-worlds-strongest-sokoban-solver
87•ibobev•3d ago•16 comments

UK fridges secured from hackers

https://www.bbc.co.uk/news/articles/c6eq49zyx7p4o
64•tomnext•3h ago•45 comments

FFmpeg 9.1 'Gauss'

https://ffmpeg.org/download.html#release_9.1
185•gyan•8h ago•26 comments

µ-Wire – USB on an ATtiny 10

https://cpldcpu.com/2014/03/19/%c2%b5-wire-usb-on-an-attiny-10/
62•mofosyne•1d ago•3 comments

I can’t believe it’s 1!

https://aperiodical.com/2026/11/i-cant-believe-its-1/
4•ColinWright•3d ago•0 comments

Postgres 19 Repack: Faster, Built-In Table Bloat Cleanup

https://www.snowflake.com/en/blog/engineering/postgres-19-repack-table-bloat/
129•craigkerstiens•10h ago•20 comments

Jujutsu Primer

https://ethanlowman.com/posts/jj-primer/
151•renehsz•7h ago•98 comments

"I can tell you wrote this yourself"

https://em-online.bearblog.dev/i-can-tell-you-wrote-this-yourself/
253•BrunoBernardino•5h ago•253 comments

Claude solves two open problems in the physics of black holes

https://www.anthropic.com/research/claude-black-hole-physics
516•cybermango•19h ago•242 comments

How to CAD Almost Anything

https://ocw.mit.edu/courses/res-16-002-how-to-cad-almost-anything-january-iap-2024/
299•o4c•3d ago•96 comments

Show HN: Radiotherapy Delivery Demo

https://tps.neuralrad.com
8•coolwulf•5d ago•3 comments

PostgreSQL 19

https://www.postgresql.org/docs/release/19.0/
254•linzhangrun•9h ago•14 comments

What Comes After AGI?

https://institute.deepmind.com/essays/what-comes-after-agi/
87•jdkee•10h ago•166 comments

Vint Cerf on why TCP/IP was never patented

https://seremot.com/p/vint-cerf-on-why-tcpip-was-never
121•emot•11h ago•57 comments

Bit Shifting in Basic

https://subethasoftware.com/2020/06/11/bit-shifting-in-basic/
52•efren6•3d ago•4 comments

Pancreatic cancer halted by virus injection in three patients

https://www.newscientist.com/article/2528235-pancreatic-cancer-halted-by-virus-injection-in-three...
807•cybermango•19h ago•139 comments

Synology Security Advisory

https://www.synology.com/en-uk/security/advisory/Synology_SA_26_21
163•choult•14h ago•120 comments

Automatic Checking of Compiler Correctness with E-Graphs

https://stng.substack.com/p/automatic-checking-of-compiler-correctness
48•g0xA52A2A•2d ago•0 comments

The Market Is Down

https://anihil.com/the-market-is-down
39•anihil•1h ago•9 comments

Pete Warden on local AI, open models, voice interfaces, the future of hardware

https://thedataexchange.media/pete-warden-moonshine/
260•datascientist•21h ago•227 comments

Someone reported java4shell bug in September 2026

https://github.com/openjdk/jdk/pull/32781
438•notmine1337•1d ago•124 comments

The 98% Slot Machine: How Paid Advertising Became an Extraction Tax

https://globalcommercegraph.com/writing/the-ninety-eight-percent-slot-machine
314•dev1one1•18h ago•159 comments
Open in hackernews

Linear Programming for Fun and Profit

https://modal.com/blog/resource-solver
62•hmac1282•1y ago

Comments

ayhanfuat•1y ago
> X = [x1, ..., Xn]: instances of each type to launch

Is this a continuous variable? Seems discrete to me. I am surprised it is solved by simplex.

Frummy•1y ago
It's the answer, a vector of integers
ayhanfuat•1y ago
Simplex cannot give a vector of integers though, unless the constraint matrix is unimodular. Maybe the integrality constraint was relaxed.
cweld510•1y ago
You're right -- we do relax the integrality constraint, gaining performance at the expense of some precision, and we're generally able to paper over the difference at scheduling time. We've investigated integer linear programming for some use cases, but for solves to run quickly, we have to constrain the inputs significantly.
ayhanfuat•1y ago
Thanks for the clarification. I guess it wouldn’t matter much if the numbers are large. Initially I thought they were mostly ones and zeros.
stncls•1y ago
If this is business critical for you, you may want to switch to a faster solver. Glop is very nice, but it would be reasonable to expect a commercial solver (Gurobi, XPress, COpt) to be 60x faster [1]. By the same measure, the best open source solvers (CLP, HiGHS) are 2-3x faster than Glop.

Actually, the commercial solvers are so fast that I would not be surprised if they solved the IP problem as fast as Glop solves the LP. (Yes, the theory says it is impossible, but in practice it happens.) The cost of a commercial solver is 10k to 50k per license.

[1] ... this 60x number has very high variance depending on the type of problem, but it is not taken out of nowhere, it comes from the Mittelmann LP benchmarks https://plato.asu.edu/ftp/lpopt.html There are also benchmarks for other types of problems, including IP, see the whole list here: https://plato.asu.edu/bench.html

petters•1y ago
If you are able to paper over the fractional numbers and get a usable solution, an integer solver should also be able to find a feasible solution easily. Perhaps not optimal, but better than just solving the LP and rounding
hustwindmaple1•1y ago
You are basically doing a heurstic. Your solutions are not guaranteed to be optimal. Integer programming is the way to do.
cweld510•1y ago
Great to see this post here -- really enjoyed writing it! I think it's really cool how an algorithm from an operational research context can play a critical role in a high-availability large-scale cloud service.
sumtechguy•1y ago
LP is a shockingly good way to optimize a system. If you can put inputs/outputs into the correct form. Had an econ prof that loved these things for doing supply/demand maxima and minimum finding. He didnt outright say it but I think it was his current line of study when I was taking classes from him the 90s. I thought that, as he managed to bring it up in every class he taught.
Onavo•1y ago
Well, kantorovich did win the Nobel for inventing that.
underanalyzer•1y ago
Neat article. I do wish it mentioned that there are polynomial time algorithms to solve linear programming problems. According to the Google ortools docs it has the option to use those as well (but not with the GLOP solver). Might be good for when simplex is struggling (https://developers.google.com/optimization/lp/lp_advanced)
stncls•1y ago
You're right, but it's very subtle and complicated.

In theory, the simplex method is not known to be polynomial-time, and it is likely that indeed it is not. Some variants of the simplex method have been proven to take exponential time in some worst cases (Klee-Minty cubes). What solvers implement could be said to be one such variant ("steepest-edge pricing"), but because solvers have tons of heuristics and engineering, and also because they work in floating-point arithmetic... it's difficult to tell for sure.

In practice, the main alternative is interior-point (aka. barrier) methods which, contrary to the simplex method, are polynomial-time in theory. They are usually (but not always) faster, and their advantage tends to increase for larger instances. The problem is that they are converging numerical algorithms, and with floating-point arithmetic they never quite 100% converge. By contrast, the simplex method is a combinatorial algorithm, and the numerical errors it faces should not accumulate. As a result, good solvers perform "crossover" after interior-point methods, to get a numerically clean optimal solution. Crossover is a combinatorial algorithm, like the simplex method. Unlike the simplex method though, crossover is polynomial-time in theory (strongly so, even). However, here, theory and practice diverge a bit, and crossover implementations are essentially simplified simplex methods. As a result, in my opinion, calling iterior-point + crossover polynomial-time would be a stretch.

Still, for large problems, we can expect iterior-point + crossover to be faster than the simplex method, by a factor 2x to 10x.

There is also first-order methods, which are getting much attention lately. However, in my experience, you should only use that if you are willing to tolerate huge constraint violations in the solution, and wildly suboptimal solutions. Their main use case is when other solvers need too much RAM to solve your instance.

Onavo•1y ago
The most interesting question is how you scrape the prices. The cloudprovider really need to provide an API.
underanalyzer•1y ago
Very interesting! Thanks for the reply. I wonder if they tried these other solvers and decided they were either too slow b/c their problems were too small or the answers were too inaccurate