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?

Steam Machine Game Testing

Iris – A portable runtime for durable AI agents

Show HN: Block/buzz: a workspace built for teams of humans and agents

Geometry of causal set theory with physics implications

Angeldust – a solo-built voxel world that runs on everything [video]

Does AI have a UI/UX problem?

Daybreak: Tools for securing every organization in the world

A Glimpse into the "Search Your Target" Market for Stolen Credentials

A 10-person team cut median cycle time from 72 to 27 hours in 30 days

Meta's Crawler Ate My 2TB Bandwidth

Steam Machine 512GB

A viral doomsday scenario aims to shake Europe out of its AI complacency

Steam Machine

Blogger Defeats Photographer's Copyright Claim-Sokolskyfilm vs. Messiah

Unit Tests for a Novel

My journey of making my first-ever circuit

The Download: record-breaking subsea tunnels and flexible data centers

Europe faces rising competition for energy from Asia

Tata Electronics cyber breach claiming to expose Apple, Tesla trade secrets

Show HN: Loqi, a "local-first" translation tool using Ollama/llama.cpp

Show HN: React Native Boost – swaps RN's Text/View wrappers for native ones

It Was Always Email

Plans for battery swapping Electric trucks in UK

The Probability Index: Passive exposure to the market portfolio of probabilities

The Optimal Amount of Slop Is Non-Zero

AMD releases FSR 4.1 upscaling for older graphics cards

Absolute State of Unreal 2026

Show HN: Vivijure – Self-hosted AI film studio on your own GPU (AGPL)

Mexico Just Showed Off a New Cheap, Government-Backed EV

Stop Slopping Your Skills