Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•1y ago

Comments

nine_k•1y ago

> Introducing the ‘packed’ data format, a binary format that allows using data as it is, without the need for a deserialisation step. A notable perk of this format is that traversals on packed trees is proven to be faster than on ‘unpacked’ trees: as the fields of data structures are inlines, there are no pointer jumps, thus making the most of the L1 cache.

That is, a "memory dump -> zero-copy memory read" of a subgraph of Haskell objects, allowing to pass such trees / subgraphs directly over a network. Slightly reminiscent of Cap'n Proto.

90s_dev•1y ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•1y ago

They mention this in the article.

spockz•1y ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•1y ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•1y ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•1y ago

> the serialised version of the data is usually bigger than its in-memory representation

I don’t think this is common. Perhaps for arrays of floats serialized as JSON or something. But I can’t think of a case where binary serialization is bigger. Data types like maps are necessarily larger in memory to support fast lookup and mutability.

nine_k•1y ago

I suppose all self-describing formats, like protobuf, or thrift or, well, JSON are bigger than the efficient machine representation, because they carry the schema in every message, one way or another.

IsTom•1y ago

If you use a lot of sharing in immutable data it can grow a lot when serializing. A simple pathological example would be a tree that has all left subtrees same as the right ones. It takes O(height) space in memory, but O(2^height) when serialized.

gitroom•1y ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•1y ago

This was very well written. Excellent article!

NetOpWibby•1y ago

Is this like MessagePack for Haskell?

Ransome and May Mill Engine

Machining Square Inside Corners: Conquer the Nightmare

Model Aero Engines Free Manufacturable Plans/Blueprints

Daphne – Oramics Inspired DAW

Computerized clairvoyance: psychics push back against AI-generated readings

Octoverse: Commits reach new highs in 2026 as developers build with agents

Meridian: A peer-to-peer browser game world built by an AI agent

Show HN: Multi-Layer ASCII Art

France approves $11B tax based on content delivered to French subscribers

The AI boom spawns job market for data-center liaisons

Screen Capture for macOS – Open-source sticky-aware scrolling capture

Show HN: LanesMac – A scrolling tiling window manager for macOS

Show HN: What [67] MCP servers do at startup, with the internet cut off

Show HN: Create a Dumbphone on Android

"Vibe coded my parents' TV this afternoon "

Why Sam Altman is against a single superintelligence

Astronomers make startling discovery of a possible dwarf planet beyond Pluto

Samourai Wallet developer Keonne Rodriguez recounts a 29-day prison transfer

If CA matched TX on property taxes, it would raise more than the billionaire tax

A Second Life Under Constraints

The History of Every Video Game Genre

Defeating highly encrypted and obfuscated code – tutorial (SRBMiner-MULTI 3.7.3)

Getting Back in the Zone

Knowledge Spillovers, Competition, and Individual Careers [pdf]

We're Training a Figma-Fluent Editing Model

I replaced macOS say with local neural speech

The first life and death of Italian computing (1954 – 1964)

Vroot – Instant, daemonless root sandboxes from a single flag

Mitigations for CVE-2026-98432 [IPv4 TCP handshake use-after-free]

Do you still need embeddings for semantic search? - my little experiment