frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Java4Shell: RCE in OpenJDK when processing Base64

https://calif.io/java4shell/
486•werrett•4h ago•132 comments

GPT‑6.2 Astra and Sol

https://openai.com/index/introducing-gpt-6-2-astra-sol/
1071•jasondavies•7h ago•683 comments

Quad9's withdrawal from France: A canary in the coal mine

https://blog.cloudflare.com/quad9-withdrawal-from-france/
254•subset•3h ago•71 comments

Archive Team is archiving the Apple Support Community (closes November 20, 2026)

https://wiki.archiveteam.org/index.php/Apple_Discussions
57•digitaldragon•1h ago•14 comments

Microsoft's ONNX Runtime has disappeared from GitHub

https://github.com/microsoft/onnxruntime
95•nvader•1h ago•22 comments

Nvidia stopped disclosing Singapore sales as revenues hit $104B

https://www.ft.com/content/dbde7a30-548c-4f9d-a4be-7898a0c24dcf
379•louiereederson•8h ago•186 comments

Google's AI answers reducing search traffic by 40%

https://revscope.co/blog/search-seo-geo-2026/
27•slashdev•56m ago•12 comments

jQuery 4.1.0

https://github.com/jquery/jquery/releases/tag/4.1.0
248•petecooper•5h ago•134 comments

ID.me terms required for IRS sign-in

https://consumerrights.wiki/w/ID.me_terms_required_for_IRS_sign-in
21•DeepLogin•23m ago•1 comments

MAI Code 2 and Code 2 Flash

https://microsoft.ai/news/introducing-mai-code-2-and-mai-code-2-flash/
280•lemonish97•6h ago•131 comments

Highly classified US national security communications network goes down

https://www.cnn.com/2026/11/17/politics/highly-classified-national-security-communications-networ...
459•monkeydust•9h ago•541 comments

Phrack 73 Released

https://phrack.org/issues/73/introduction_md
267•notmine1337•6h ago•31 comments

350 years ago, Ole Rømer discovered that light has a finite speed

https://www.sciencenorway.no/culture-history-history-of-science/350-years-ago-this-man-discovered...
235•dxs•5h ago•73 comments

Solid 2.0

https://www.solidjs.com/blog/solid-2-0-the-long-hold/
219•pier25•6h ago•56 comments

Launch HN: StarSling (YC P25) – Self-improving CI for agent-volume repos

https://starsling.dev
53•yonasb•6h ago•31 comments

What is the best harness for each model?

https://runta.com/blog/introducing-frontierharness-eval-v1-1/
332•Edward40•10h ago•114 comments

Web Browser Engineering (2021)

https://browser.engineering/
118•ibobev•5h ago•20 comments

Apple Services Down

https://developer.apple.com/system-status/
621•willy_k•7h ago•344 comments

Harvard researchers find AI coding agents shifted the bottleneck to code review

https://complexdiscovery.com/harvard-researchers-find-ai-coding-agents-shifted-the-bottleneck-to-...
35•judahmeek•3h ago•65 comments

Tencent Hy4 Flash

https://hy.tencent.ai/research/hy4-flash
43•lyra1337•4h ago•9 comments

Effects of a Nuclear Detonation in Low Earth Orbit

https://arxiv.org/abs/2611.09827
75•PaulHoule•5h ago•43 comments

YC wrote software to run our internship expo – and an 8-bit SIM to show it off

1•ryankicks•8h ago

Who Builds the Machines That Build the Machines?

https://read.corematter.com/p/section-232-us-machine-tools
92•gmays•7h ago•28 comments

Not Everything Needs an LLM

https://newsletter.posthog.com/p/decision-models
91•speckx•6h ago•38 comments

Munich Laser Emits a Beam of Matter Waves (1999)

https://www.sciencedaily.com/releases/1999/03/990317060831.htm
10•peter_d_sherman•2d ago•3 comments

Latent Lattice Language Models

https://shivamduggal4.github.io/latent-lattice-language-models/
17•E-Reverance•2h ago•4 comments

Mouse Party

https://aboard.com/lets-have-a-mouse-party/
60•bookofjoe•3d ago•10 comments

How the Claude Code team thinks about verification

https://claude.dev/blog/how-the-claude-code-team-thinks-about-verification/
261•craigmart•14h ago•202 comments

New Evidence Shows School Phone Bans Are Gradually Improving Test Scores

https://www.nytimes.com/2026/11/17/upshot/school-phone-bans-study-scores.html
1149•donohoe•13h ago•578 comments

Show HN: Alloy CSS, dialogs, menus and tabs that work with JavaScript off

https://alloyhtml.com/example.html
177•prafandy•10h ago•31 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