frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

Nano Banana Pro

https://blog.google/technology/ai/nano-banana-pro/
337•meetpateltech•2h ago•216 comments

The Banished Bottom of the Housing Market

https://www.ryanpuzycki.com/p/the-banished-bottom-of-the-housing
72•barry-cotter•1h ago•31 comments

Red Alert 2 in web browser

https://chronodivide.com/
230•nsoonhui•4h ago•73 comments

Interactive World History Atlas Since 3000 BC

http://geacron.com/home-en/
207•not_knuth•7h ago•100 comments

Firefox 147 Will Support the XDG Base Directory Specification

https://www.phoronix.com/news/Firefox-147-XDG-Base-Directory
171•bradrn•2h ago•52 comments

Freer Monads, More Extensible Effects [pdf]

https://okmij.org/ftp/Haskell/extensible/more.pdf
15•todsacerdoti•2h ago•0 comments

Theft of the Weeping Woman from the National Gallery of Victoria

https://en.wikipedia.org/wiki/Theft_of_The_Weeping_Woman_from_the_National_Gallery_of_Victoria
19•neom•5d ago•4 comments

40 years ago, Calvin and Hobbes' burst onto the page

https://www.npr.org/2025/11/18/nx-s1-5564064/calvin-and-hobbes-bill-watterson-40-years-comic-stri...
256•mooreds•5h ago•81 comments

Android/Linux Dual Boot

https://wiki.postmarketos.org/wiki/Dual_Booting/WiP
226•joooscha•3d ago•117 comments

Adversarial Poetry as a Universal Single-Turn Jailbreak Mechanism in LLMs

https://arxiv.org/abs/2511.15304
140•capgre•5h ago•88 comments

CUDA Ontology

https://jamesakl.com/posts/cuda-ontology/
198•gugagore•3d ago•30 comments

Basalt Woven Textile

https://materialdistrict.com/material/basalt-woven-textile/
170•rbanffy•11h ago•100 comments

IBM Delivers New Quantum Package

https://newsroom.ibm.com/2025-11-12-ibm-delivers-new-quantum-processors,-software,-and-algorithm-...
9•donutloop•1w ago•0 comments

Europe is scaling back GDPR and relaxing AI laws

https://www.theverge.com/news/823750/european-union-ai-act-gdpr-changes
882•ksec•1d ago•1013 comments

Smart Performance Hacks for Faster Python Code

https://blog.jetbrains.com/pycharm/2025/11/10-smart-performance-hacks-for-faster-python-code/
44•ashvardanian•1w ago•17 comments

Towards Interplanetary QUIC Traffic

https://ochagavia.nl/blog/towards-interplanetary-quic-traffic/
80•wofo•2d ago•19 comments

DOS Days – Laptop Displays

https://www.dosdays.co.uk/topics/laptop_displays.php
62•nullbyte808•8h ago•13 comments

Meta Segment Anything Model 3

https://ai.meta.com/sam3/
607•lukeinator42•23h ago•122 comments

Loose wire leads to blackout, contact with Francis Scott Key bridge

https://www.ntsb.gov:443/news/press-releases/Pages/NR20251118.aspx
403•DamnInteresting•20h ago•188 comments

Scientists Reveal How the Maya Predicted Eclipses for Centuries

https://www.sciencealert.com/scientists-reveal-how-the-maya-predicted-eclipses-for-centuries
57•rguiscard•6d ago•15 comments

The lost cause of the Lisp machines

https://www.tfeb.org/fragments/2025/11/18/the-lost-cause-of-the-lisp-machines/
123•enbywithunix•21h ago•126 comments

Judgement on Dr Matthew Garrett (@mjg59) vs. Dr Roy Schestowitz (Techrights.org)

https://caselaw.nationalarchives.gov.uk/ewhc/kb/2025/3063
70•jonty•3h ago•53 comments

Wrapping my head around AI wrappers

https://www.wreflection.com/p/wrapping-my-head-around-ai-wrappers
32•nowflux•4d ago•18 comments

Researchers discover security vulnerability in WhatsApp

https://www.univie.ac.at/en/news/detail/forscherinnen-entdecken-grosse-sicherheitsluecke-in-whatsapp
290•KingNoLimit•20h ago•116 comments

Verifying your Matrix devices is becoming mandatory

https://element.io/blog/verifying-your-devices-is-becoming-mandatory-2/
172•LorenDB•16h ago•199 comments

Building more with GPT-5.1-Codex-Max

https://openai.com/index/gpt-5-1-codex-max/
461•hansonw•23h ago•285 comments

New Proofs Probe Soap-Film Singularities

https://www.quantamagazine.org/new-proofs-probe-soap-film-singularities-20251112/
33•pseudolus•1w ago•2 comments

A surprise with how '#!' handles its program argument in practice

https://utcc.utoronto.ca/~cks/space/blog/unix/ShebangRelativePathSurprise
94•SeenNotHeard•1d ago•81 comments

Details about the shebang/hash-bang mechanism on various Unix flavours (2001)

https://www.in-ulm.de/%7Emascheck/various/shebang/
68•js2•12h ago•14 comments

Precise geolocation via Wi-Fi Positioning System

https://www.amoses.dev/blog/wifi-location/
232•nicosalm•19h ago•98 comments
Open in hackernews

Link Time Optimizations: New Way to Do Compiler Optimizations

https://johnnysswlab.com/link-time-optimizations-new-way-to-do-compiler-optimizations/
39•signa11•6mo ago

Comments

sakex•6mo ago
Maybe add the date to the title, because it's hardly new at this point
vsl•6mo ago
...or in 2020 (the year of the article).
Deukhoofd•6mo ago
What do you mean, new? LTO has been in GCC since 2011. It's old enough to have a social media account in most jurisdictions.
jeffbee•6mo ago
Pretty sure MSVC ".NET" was doing link-time whole-program optimization in 2001.
andyayers•6mo ago
HPUX compilers were doing this back in 1993.
jeffbee•6mo ago
Oh yeah, well ... actually I got nothin'. You win.

I will just throw in some nostalgia for how good that compiler was. My college roommate brought an HP pizza box that his dad secured from HP, and the way the C compiler quoted chapter and verse from ISO C in its error messages was impressive.

abainbridge•6mo ago
Or academics in 1986: https://dl.acm.org/doi/abs/10.1145/13310.13338

The idea of optimizations running at different stages in the build, with different visibility of the whole program, was discussed in 1979, but the world was so different back then that the discussion seems foreign. https://dl.acm.org/doi/pdf/10.1145/872732.806974

srean•6mo ago
Yes and if I remember correctly there used to be Linux distros that had all the distro binaries LTO'ed.
phkahler•6mo ago
I tried LTO with Solvespace 4 years ago and got about 15 percent better performance:

https://github.com/solvespace/solvespace/issues/972

Build time was terrible taking a few minutes vs 30-40 seconds for a full build. Have they done anything to use multi-core for LTO? It only used one core for that.

Also tested OpenMP which was obviously a bigger win. More recently I ran the same test after upgrading from an AMD 2400G to a 5700G which has double the cores and about 1.5x the IPC. The result was a solid 3x improvement so we scale well with cores going from 4 to 8.

wahern•6mo ago
Both clang and GCC support multi-core LTO, as does Rust. However, you have to partition the code, so the more cores you use the less benefit to LTO. Rust partitions by crate by default, but it can increase parallelism by partitioning each crate. I think "fat LTO" is the term typically used for whole-program, or at least in the case of Rust, whole-crate LTO, whereas "thin LTO" is what you get when you LTO partitions and then link those together normally. For clang and GCC, you can either have them automatically partition the code for thin LTO , or do it explicitly via your Makefile rules[1].

[1] Interestingly, GCC actually invokes Make internally to implement thin LTO, which lets it play nice with GNU Make's job control and obey the -j switch.

WalterBright•6mo ago
Link time optimizations were done in the 1980s if I recall correctly.

I never tried to implement them, finding it easier and more effective for the compiler to simply compile all the source files at the same time.

The D compiler is designed to be able to build one object file per source file at a time, or one object file which combines all of the source files. Most people choose the one object file.

srean•6mo ago
I think MLton does it this way.

http://mlton.org/WholeProgramOptimization

Dynamically linked and dynamically loaded libraries are useful though (paid for with its problems of course)

tester756•6mo ago
Yea, generating many object files seems like weird thing. Maybe it was good thing decades ago, but now?

Because then you need to link them, thus you need some kind of linker.

Just generate one output file and skip the linker

WalterBright•6mo ago
I've considered many times doing just that.
tester756•6mo ago
And what was the result/conclusion of such considerations?
WalterBright•6mo ago
Not worth the effort.

1. linkers have increased enormously in complexity

2. little commonality between linkers for different platforms

3. compatibility with the standalone linkers

4. trying to keep up with constant enhancement of existing linkers

yencabulator•6mo ago
Not maybe. Sufficient RAM for compilation was a serious issue back in the day.
kazinator•6mo ago
Sure, and if any file is touched, just process them all.
adrian_b•6mo ago
Some compilers had incremental compilation to handle this during development builds.

Then only the functions touched inside some file would be recompiled, not the remainder of the file or other files.

Obviously, choosing incremental compilation inhibited some optimizations.

adrian_b•6mo ago
Generating many object files is pointless for building an executable or a dynamic library, but it remains the desired behavior for building a static library.

Many software projects that must generate multiple executables are better structured as a static library plus one source file with the "main" function for each executable.

WalterBright•6mo ago
One thing the D compiler does is it can generate a library in one step (no need to use the librarian). Give a bunch of source files and object files on the command line, specify a library as the output, and boom! library created directly (compiling the source files, and adding the object files).

I haven't used a librarian program for maybe a decade.

senkora•6mo ago
In C++, there is a trick to get this behavior called "unity builds", where you include all of your source files into a single file and then invoke the compiler on that file.

Of course, being C++, this subtly changes behavior and must be done carefully. I like this article that explains the ins and outs of using unity builds: https://austinmorlan.com/posts/unity_jumbo_build/

WalterBright•6mo ago
> this subtly changes behavior

The D module design ensures that module imports are independent of each other and are independent of the importer.

YorickPeterse•6mo ago
For Inko (https://inko-lang.org/) I went a step further: it generates an object file for each type, instead of per source file or per project. The idea is that if e.g. a generic type is specialized into a new instance (or has some methods added to it), only the object file for that type needs to be re-generated. This in turn should allow for much more fine-grained incremental compilation.

The downside is that you can end up with thousands of object files, but for modern linkers that isn't a problem.

dooglius•6mo ago
It sounds like this would prevent the inherit concurrency you would get out of handling files separately?
WalterBright•6mo ago
It's complicated and not at all clear. For example, most modules import other modules. With separate compilation, most of the modules need to be compiled multiple times, with all-together, it's only once.

On the other hand, the optimizer and code generator can be run concurrently in multiple processes/threads.

Remnant44•6mo ago
Link time optimization is definitely not new, but it is incredibly powerful - I have personally had situations where the failure to be able to inline functions from a static library without lto cut performance in half.

It's easy to dismiss a basic article like this, but it's basically a discovery that every Junior engineer will make, and it's useful to talk about those too!

srean•6mo ago
The inline keyword should really have been intended for call sites rather than definitions.

Perhaps language designers thought that if a function needs to be inlined everywhere, it would lead to verbose code. In any case, it's a weak hint that compilers generally treat with much disdain.

lilyball•6mo ago
ffmpeg has a lot of assembly code in it, so it's a very odd choice of program to use for this kind of test as LTO is presumably not going to do anything to the assembly.
mcdeltat•6mo ago
Different .c/.cpp files being a barrier to optimisation always struck me as an oddly low bar for the 21st century. Yes I know the history of compilation units but these days that's not how we use the system. We don't split code into source files for memory reasons, we do it for organisation. On a small/medium codebase and a decent computer you could probably fit dozens of source files into memory to compile and optimise together. The memory constraint problem has largely disappeared.

So why do we still use the old way? LTO seems effectively like a hack to compensate for the fact that the compilation model doesn't fit our modern needs. Obviously this will never change in C/C++ due to momentum and backwards compatibility. But a man can dream.

kazinator•6mo ago
LTO breaks code which assumes that the compiler has no idea what is behind an external function call and must not assume anything about the values of objects that the code might have access to:

    securely_wipe_memory(&obj, sizeof obj);
    return;
  }
Compiler peeks into securely_wipe_memory and sees that it has no effect because obj is a local variable which has no "next use" in the data flow graph. Thus the call is removed.

Another example:

    gc_protect(object);
    return
  }
Here, gc_protect is an empty function. Without LTO, the compiler must assume that the value of object is required for the gc_protect call and so the generated code has to hang on to that value until that call is made. With LTO, the compiler peeks at the definition of gc_protect and sees the ruse: the function is empty! Therefore, that line of code does not represent a use of the variable. The generated code can use the register or memory location for something else long before that line. If the garbage collector goes off in that part of the code, the object is prematurely collected (if what was lost happens to be the last reference to it).

Some distros have played with turning on LTO as a default compiler option for building packages. It's a very, very bad idea.

djmips•6mo ago
So slow
jordiburgos•6mo ago
Any idea on the performance improvements with these LTO?