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?

Playing Music Without Headphones Could Cost You £1k on Trains

TriFlow: Artist-Like 3D Mesh Topology via Nearest-Vertex Vector Fields [video]

Code Is Clay Now

Feds Suspect Ransom Negotiator Ran ShinyHunters Extortion Site

Show HN: YouLangTube – YouTube subtitles that fade out as your level improves

What Is RTMP? A Beginner's Guide to the Video Streaming Protocol

Ask HN: Why HN dosen't have bot problem?

Molagri raises $5.8M to build 'updatable' biopesticides

Musk pledges a share of his SpaceX company to 'every kid in America'

Ontology-Driven Observability: Building an End-to-End Knowledge Graph at Netflix

AI Assistance Reduces Persistence and Hurts Independent Performance

Big Tech Oligarchs Have a Terrible Plan for Humanity

Uncut: Open-source video editor where Claude Code edits the timeline

My Year of O.C.D.

WFP stops provision to half a million people in Gaza over lack of funding

Show HN: LexFrame – Break the ceiling of Anthropic's J-lens in reading LLMs

Everything is Nix if you squint hard enough

I created a tools for devs and users with AuDHD issues to have friendly UIs

Subscribe and Save items have a price increase

Playdate's update interface takes charge

Code Like a Pilot

Run LLM Locally – which open model fits your GPU or Mac, and how fast

AI hotel receptionist that books rooms by voice and confirms on multiple channel [video]

Tenstorrent raises $1.5B Series E at $6.2B valuation

The immortal jellyfish can beat ageing

Show HN: Buddylist – Coding agents in an MSN-style messenger

One Manhattan power room took down FAA air traffic control in 1991

Agentic Monitoring

Everything Is a Leaky Abstraction

Copy Cats