frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Inkling-2-Mini in 5.4 GB Memory

https://github.com/ShinMegamiBoson/lookatmyquant
131•k__•1h ago•14 comments

Brazil's tax authority open-sources its tax calculator on GitHub under MIT

https://www.gov.br/receitafederal/pt-br/assuntos/noticias/2026/novembro/receita-federal-publica-p...
557•dvaplima•4d ago•181 comments

Lean verification of the Riemann Hypothesis

https://leanprover-community.github.io/blog/posts/riemann-hypothesis/
551•g-b-r•5h ago•423 comments

Detonating a pile of lead azide

https://www.science.org/content/blog-post/detonating-huge-pile-lead-azide-really
397•beginning_end•6h ago•265 comments

PostgreSQL Extensions in Go

https://jespino.github.io/gopgext/
65•valyala•2h ago•4 comments

My monitor was cutting my download speed by 75%

https://blog.tymscar.com/posts/studiodisplayethernet/
342•soheilpro•9h ago•179 comments

Hurried Announcement: Alessandro Masullo GRH

https://math216.wordpress.com/2026/11/20/hurried-announcement-alessandro-masullo-grh/
2338•jasondavies•1d ago•1118 comments

Verification files for the Lean proof of the Riemann Hypothesis

https://math.mit.edu/~drew/grh/
43•Bluestein•3h ago•13 comments

Inkling 2 Mini

https://thinkingmachines.ai/news/inkling-2-mini/
1291•jasondavies•23h ago•265 comments

I'm quite pleased by the tech architecture of my art website

https://klauria.tech/klauria-art/
96•evakhoury•1d ago•18 comments

RCE in Gnupg

https://lists.gnupg.org/pipermail/gnupg-announce/2026q4/000517.html
191•gdgghhhhh•11h ago•67 comments

How I made a custom game engine for Satelital

https://spectralorbit.com/blog/satelital_game_engine
11•todsacerdoti•3d ago•1 comments

LLMs can read and write executables byte by byte from a hex dump

https://sgiannopoulos.github.io/blog/machine-code-programming/
130•fortran77•3d ago•89 comments

Tropical Rainforests Species may be surprisingly young

https://phys.org/news/2026-11-species-tropical-rainforests-young-emergence.html
6•PaulHoule•4d ago•1 comments

Ask HN: I have been unemployed for 2y. 15 years of experience, US. What to do?

499•LetThingsBeDiff•20h ago•558 comments

Deterministic Simulation Testing Is for Everyone

https://outdata.net/blog/261120
55•pgraug•1d ago•6 comments

Show HN: An ASCII cell aquarium for your terminal

https://github.com/kborer/cells/
29•kborer•3d ago•11 comments

We promoted developers into architects without informing them

https://manidoraisamy.com/developer-to-architect.html
549•QueensGambit•1d ago•299 comments

Upload2Shell · CVE-2026-125396

https://pwn.ai/upload2shell
8•f311a•1h ago•2 comments

Jensen Huang's fall is bad news for Silicon Valley's accelerationists

https://www.economist.com/business/2026/11/19/jensen-huangs-fall-is-bad-news-for-silicon-valleys-...
112•andsoitis•1h ago•195 comments

Astra 6.2 and Sol 6.2 flop at Simple Bench

https://simple-bench.com/
143•algoth1•6h ago•130 comments

Unforced Navier-Stokes Singularity and the Generalized Riemann Hypothesis

https://terrytao.wordpress.com/2026/11/20/unforced-euler-singularity-unforced-navier-stokes-singu...
518•archon1410•1d ago•225 comments

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

https://alpo.ge/remark.pdf
2840•iamronaldo•1d ago•2009 comments

The Soviet Elektronika BK-0010 home computer built on a clone of the PDP-11 CPU

https://8bitarchitect.net/machines/elektronika-bk-0010/
39•andrewstuart•4d ago•12 comments

NINLIVE: The Nine Inch Nails live archive

https://ninlive.com/
337•CharlesW•21h ago•95 comments

ClawDOS – An AI coding agent for DOS

http://ricapar.net/ClawDOS/
140•Ricapar•14h ago•43 comments

Clojure will affect the way you think about programming (2017)

https://eli.thegreenplace.net/2017/clojure-the-perfect-language-to-expand-your-brain/
181•sammatilda•17h ago•83 comments

Slopstrap – Make your site look hastily vibecoded

https://slopstrap.mikelacher.com/
590•mlacher•1d ago•114 comments

Surprisingly Adorable Insect Portraits

https://amateurphotographer.com/latest/these-astonishing-insect-portraits-reveal-a-hidden-world-y...
132•NordStreamYacht•13h ago•28 comments

Language Models Can Rewrite Their Own Weights

https://arxiv.org/abs/2611.21885
470•lwhsiao•1d ago•140 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