nowfound

Alternatives

Products that do what go-binsync – Go binary patches up to 67× smaller than bsdiff does

This project is a little performance-optimization experiment focused on reducing the size of Go binary patches, which can be useful for quick incremental updates of live services. When a Go program grows by a few bytes through an incremental change, a bunch of related references and offsets throughout the compiled binary end up changing that makes general-purpose binary-diff encoders inefficient: `zstd --patch-from` produces a 530kb patch for a one-line change in a 30MB binary. bsdiff improves upon this (150KB patch) thanks to a delta compression algorithm that can handle relative offsets.…

  1. 1BD
  2. 2GB

    2024 · github.com

  3. 3A1
  4. 4GE
  5. 5DS

    DeltaGlider is a CLI/SDK similar to `aws s3` or `boto3`. UPLOAD: It stores the first file in a S3 path as a full-size (reference), but saves next uploaded archives as deltas (tiny binary diffs) with respect to the reference. DOWNLOAD: it reconstructs the original file on the fly, bit-perfect and verified with SHA256. Why Xdelta3? It's a compression-aware and block-level binary diff algorithm. Perfect for representing differences between archives, where small changes shift bytes but most content stays the same. It can efficiently delta compress ZIP/JAR/TAR archives up to 99.9%…

    Nov 2025 · github.com

  6. 6GB
  7. 7GA

    Author of gocryptfs and co-maintainer of EncFS here. gocryptfs is a FUSE overlay filesystem for Linux like EncFS. But it is written from scratch in Go, uses modern crypto and fixes the security issues of EncFS while providing equivalent speed. Some of the key differences to EncFS are: * Just one security level roughly equivalent to EncFS "paranoia" mode, at the speed of "default" mode. * A design so simple it fits on one page ( this one: https://nuetzlich.net/gocryptfs/security/ ) * Explicit filesystem creation using "gocryptfs -init". No configuration prompts. *…

    2016

  8. 8SA
  9. 9SL

    I'd like to share a little toy project of mine, a really simple image codec that can do lossy to full lossless image compression with complete scalability at a byte level granularity - you can compress an image just once, even fully losslessly if needed, and then get any lossy version possible by simply stopping decompression at any offset in the compressed data. This "encode onde, serve many" approach is especially interesting for providing downscaled low quality image previews (LQIP) in as tight a storage budget as possible, and then allowing seamless, transparent refinement as deemed…

    2024 · github.com

  10. 10IB

    Hey HN, A CSV parser using Go 1.26's experimental simd/archsimd package. I wanted to see what the new SIMD API looks like in practice. CSV parsing is mostly "find these bytes in a buffer"—load 64 bytes, compare, get a bitmask of positions. The interesting part was handling chunk boundaries correctly (quotes and line endings can split across chunks). - Drop-in replacement for encoding/csv - ~20% faster for unquoted data on AVX-512 - Quoted data is slower (still optimizing) - Scalar fallback for non-AVX-512 Requires GOEXPERIMENT=simd.…

    Jan 2026 · github.com

  11. 11AD

    2018 · github.com

  12. 12ID
  13. 13ST
  14. 14DH
  15. 15GA

    Hi HN! I'm excited to share GoCard, a terminal-based spaced repetition system I built that uses plain Markdown files as its data source. I've always been frustrated with existing spaced repetition tools that lock my knowledge into proprietary formats or require constant internet access. As a developer who lives in terminals and text editors, I wanted something that: 1. Stores cards as plain text files I can edit with any editor 2. Works seamlessly with Git for versioning and sync 3. Runs in a terminal without distractions 4. Has first-class support for code snippets and programming concepts…

    2025 · github.com

  16. 16DA
  17. 17BT
  18. 18BV

    Started with a pure JS implementation (still the fastest JS image diff), but wanted to push performance further. I rewrote the core in Rust to make it the fastest open-source single-threaded image diff. On 4K images (5600×3200): ~327ms vs odiff's ~1215ms. Binaries are ~3x smaller too (~700KB vs ~2MB). The core insight: make the cold pass smarter to make the hot pass do less work. Instead of simple pixel equality, the cold pass scans dynamic-sized blocks and marks "problematic" ones - blocks that might contain differences. The hot pass then only runs YIQ perceptual diff and antialiasing check…

    Dec 2025 · github.com

  19. 19HA

    Most ZK proving systems are optimized for server-grade hardware with massive RAM. When scaling to industrial-sized traces (2^20+ rows), they often hit a "Memory Wall" where allocation and data movement become a larger bottleneck than the actual computation. I have been developing Hekate, a ZK engine written in Rust that utilizes a Zero-Copy streaming model and a hybrid tiled evaluator. To test its limits, I ran a head-to-head benchmark against Binius64 on an Apple M3 Max laptop using Keccak-256. The results highlight a significant architectural divergence: At 2^15 rows: Binius64 is faster…

    Jan 2026

  20. 20GA

    Hello HN! These last few months I've been working on my first open source project: an embedded database written in pure-go. That took me some months, as I had to learn how to deal with such large packages. Until then, all packages I had made were quite small an did not require much. I usually did not have to worry about things like allocation optimization and instance pools until This project. It started when I wanted to make a port of a tool to a TUI environment. I'm actually used to working with TUIs in golang, so that was my language of choice. The tool I wanted to port is written in…

    Feb 2026

  21. 21CS
  22. 22AD
  23. 23LA
  24. 24TS

    2016 · github.com

Ranked by how close each launch is in meaning, then by votes. Refine with a description →