Asic: Proof-of-Concept Binary Optimizer Reduces Size, More to Come
Key topics
Even with only 2 patterns implemented out of 19 identified, it reduced a test binary by 0.02%. Imagine the potential once all patterns are covered.
Highlights:
Works directly on binaries, no source changes needed.
Compatible with existing optimizations like O2/O3, Oz, and strip.
Cross-architecture potential, not limited to ARM64 or ELF.
Can complement packing tools (like UPX) without slowing execution.
This is early-stage, but the concept proves instruction-level pattern replacement is feasible. Next step: implement all hot patterns for meaningful optimization.
Would love thoughts from anyone who’s worked with binary transformations or runtime instruction emulation.
A proof-of-concept binary optimizer called ASIC is introduced, reducing a test binary size by 0.02%, sparking skepticism and requests for more information.
Snapshot generated from the HN discussion
Discussion Activity
Light discussionFirst comment
5h
Peak period
2
8-9h
Avg / period
1.3
Key moments
- 01Story posted
Sep 6, 2025 at 6:51 AM EDT
4 months ago
Step 01 - 02First comment
Sep 6, 2025 at 11:47 AM EDT
5h after posting
Step 02 - 03Peak activity
2 comments in 8-9h
Hottest window of the conversation
Step 03 - 04Latest activity
Sep 6, 2025 at 10:33 PM EDT
4 months ago
Step 04
Generating AI Summary...
Analyzing up to 500 comments to identify key contributors and discussion patterns
Want the full context?
Jump to the original sources
Read the primary article or dive into the live Hacker News thread when you're ready.
One suggestion I have is that you should run this on many binaries instead of just a single one to get an idea of effect on various binaries. If you're already doing this, my apologies. The post made it sound like you've only tested this on a single binary.