frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Hurried Announcement: Alessandro Masullo GRH

https://math216.wordpress.com/2026/11/20/hurried-announcement-alessandro-masullo-grh/
1620•jasondavies•8h ago•735 comments

Inkling 2 Mini

https://thinkingmachines.ai/news/inkling-2-mini/
716•jasondavies•6h ago•120 comments

Levent Alpöge claims proof of the Generalized Riemann Hypothesis [pdf]

https://alpo.ge/remark.pdf
2395•iamronaldo•12h ago•1618 comments

NINLIVE: The Nine Inch Nails live archive

https://ninlive.com/
143•CharlesW•4h ago•29 comments

We promoted developers into architects without informing them

https://manidoraisamy.com/developer-to-architect.html
319•QueensGambit•8h ago•189 comments

Valkey kills the skiplist, cuts sorted set overhead by up to 43%

https://valkey.io/blog/from-skiplist-to-b+tree/
48•reconditerose•3d ago•23 comments

Unforced Navier-Stokes Singularity and the Generalized Riemann Hypothesis

https://terrytao.wordpress.com/2026/11/20/unforced-euler-singularity-unforced-navier-stokes-singu...
355•archon1410•9h ago•144 comments

Language Models Can Rewrite Their Own Weights

https://arxiv.org/abs/2611.21885
344•lwhsiao•10h ago•112 comments

Sir Brian May adds new dimension to Hera asteroid

https://www.esa.int/articles/about-us/directorates/operations/space-safety/hera/sir-brian-may-add...
42•mooreds•3h ago•8 comments

DreamCoder: Coding harness and IDE from the author of Mastering Emacs

https://www.masteringemacs.org/article/announcing-dreamcoder
116•facundo_olano•6h ago•21 comments

Finite-time blow-up for the Navier–Stokes equations

https://github.com/tristanbuckmaster/navier-stokes/
260•trotro•11h ago•82 comments

And yet, it moves

https://signoregalilei.com/2026/11/20/and-yet-it-moves/
98•notfried•6h ago•48 comments

Re: Riemann

https://borretti.me/article/re-riemann
140•_dain_•2h ago•118 comments

Restricting AI agents in mobile operating systems platforms from capturing data

https://signal.org/blog/protecting-your-privacy/
514•dotcoma•16h ago•307 comments

Vibecoding an inference chip

https://ankitg.me/blog/vibecoding-inference-chip/
117•ankitvgupta•8h ago•41 comments

The stochastic parrots have apparently proved the Riemann Hypothesis

https://scottaaronson.blog/?p=10344
222•stratos123•6h ago•196 comments

Integrals of Polynomials with Galois Group S_p

https://m-slee.netlify.app/posts/integrals-galois-polynomials
5•richard_chase•1h ago•1 comments

Winedroid – run Android apps without Android (WASM demo)

https://winedroid.soham.sh/demo/
107•sohzm•7h ago•33 comments

The Hungry Butler Effect: Concealed Commercial Incentives in LLMs

https://www.researchgate.net/publication/418143113_The_Hungry_Butler_Effect_Concealed_Commercial_...
19•undefinedmethod•4h ago•8 comments

Why the Airbus A321XLR often gets stuck climbing for first few hours of flight

https://simpleflying.com/airbus-a321xlr-often-stuck-climbing-1st-few-hours-flight/
89•edward•6d ago•58 comments

US SEC's Nvidia probe is examining potential accounting issues – sources

https://www.marketscreener.com/news/us-sec-s-nvidia-probe-is-examining-potential-accounting-issue...
235•ftchd•6h ago•123 comments

Show HN: OpenComputer – an open source alternative to Devin

https://github.com/diggerhq/opencomputer
69•iacguy•6h ago•22 comments

I can’t believe it’s 1!

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

Show HN: I made an audio-to-MIDI model 60x more efficient

https://kobi.music/research/dettato
243•hidude562•4d ago•51 comments

Forking TuxGuitar into a 17-EDO tab editor

https://frogwizard.bearblog.dev/tuxguitar-17edo/
6•speckx•2d ago•5 comments

Serious cyberattack thought backed by wealthy operators

https://www.ruv.is/english/2026-11-20-serious-cyberattack-thought-backed-by-wealthy-operators-493411
19•Bender•3h ago•4 comments

I'm Peter Roberts, immigration attorney who does work for YC and startups. AMA

96•proberts•9h ago•134 comments

Show HN: An API for word timestamps from speech, 75% within 20ms

https://quebec.yarn.so
64•jasperstory•3d ago•11 comments

Merkle Tree Certificates

https://datatracker.ietf.org/doc/draft-ietf-plants-merkle-tree-certs/
18•mooreds•4h ago•2 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
632•sammatilda•16h ago•296 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