frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

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

https://github.com/openssl/openssl/pull/33652
119•JacobHenner•4h ago•62 comments

GIMP now has UI tests

https://www.gimp.org/news/2026/11/16/gimp-ui-tests/
70•qtqtqt•2h ago•55 comments

Google is pushing OEMs against GrapheneOS and bootloader unlocking

https://grapheneos.social/@GrapheneOS/117645038299496084
114•mraniki•1h ago•12 comments

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

https://www.snowflake.com/en/blog/engineering/postgres-19-repack-table-bloat/
50•craigkerstiens•3h ago•6 comments

Vint Cerf on why TCP/IP was never patented

https://seremot.com/p/vint-cerf-on-why-tcpip-was-never
77•emot•5h ago•24 comments

Claude solves two open problems in the physics of black holes

https://www.anthropic.com/research/claude-black-hole-physics
456•cybermango•12h ago•218 comments

Bit Shifting in Basic

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

Jujutsu Primer

https://ethanlowman.com/posts/jj-primer/
7•renehsz•43m ago•0 comments

FFmpeg 9.1 'Gauss'

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

How to CAD Almost Anything

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

Garage Door Spam

https://blog.harrison.page/garage-door-spam/
820•harrisonpage•3d ago•344 comments

Weight-Space Programming builds neural networks like a 1990s researcher

https://notesbylex.com/weight-space-programming-1990s
51•lexandstuff•2d ago•3 comments

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

https://globalcommercegraph.com/writing/the-ninety-eight-percent-slot-machine
249•dev1one1•11h ago•138 comments

Anthropic’s Nasdaq debut

https://www.reuters.com/business/finance/anthropics-historic-debut-put-ais-promise-peril-wall-st-...
1037•wslh•13h ago•2047 comments

Launch HN: Onlook (YC W25) – An open-source developer tool for designers

https://github.com/onlook-dev/onlook/
105•D_R_Farrell•13h ago•73 comments

Someone reported java4shell bug in September 2026

https://github.com/openjdk/jdk/pull/32781
407•notmine1337•18h ago•111 comments

ChatGPT for SNES

https://www.bxfoundry.com/chatgpt_snes/
45•evan_•6h ago•9 comments

PostgreSQL 19

https://www.postgresql.org/docs/release/19.0/
67•linzhangrun•2h ago•2 comments

Pancreatic cancer halted by virus injection in three patients

https://www.newscientist.com/article/2528235-pancreatic-cancer-halted-by-virus-injection-in-three...
717•cybermango•13h ago•112 comments

Automatic Checking of Compiler Correctness with E-Graphs

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

Show HN: Cornhole News – A Hacker News inspired site for news across the Midwest

https://cornholenews.news
210•cornholemedia•14h ago•97 comments

RegExr: Temporarily Offline

https://regexr.com/
69•somebudyelse•8h ago•36 comments

Should governments slow frontier AI? Jacob Coxon and Robin Hanson debate [video]

https://www.youtube.com/watch?v=lwfewYL7X0o
94•sandslash•11h ago•186 comments

IRA Velinsky, industrial designer for Commodore and Atari

https://dfarq.homeip.net/ira-velinsky-industrial-designer-of-the-commodore-64/
16•onename•1d ago•2 comments

Talking Venice with Mahesh Subramony at AMD In-Depth

https://chipsandcheese.com/p/talking-venice-with-mahesh-subramony
25•rbanffy•2d ago•0 comments

Rebuilding my local voice assistant pipeline

https://blog.platypush.tech/article/Rewriting-my-voice-assistant-pipeline
92•todsacerdoti•9h ago•14 comments

Synology Security Advisory

https://www.synology.com/en-uk/security/advisory/Synology_SA_26_21
132•choult•8h ago•98 comments

Postgres 19 is out, and it's available on Neon and Databricks Lakebase

https://www.databricks.com/blog/postgresql-19-available-lakebase
45•sp_from_db•5h ago•19 comments

UK government forced to admit it issued Apple a secret encryption order

https://macanorak.com/uk-government-forced-to-admit-it-issued-apple-a-secret-encryption-order/
598•Terretta•14h ago•267 comments

Making 8-page foldable zines from a single A4 sheet in the browser

https://krthr.co/paper-folds-and-whats-new-in-fanzines-app/
279•krthr•17h ago•61 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