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?

Microsoft Build CLI

Building a Retro Linux Gaming Computer (2021)

The Shadcn-Ification of the Internet

Quantum stocks soar as U.S. plans $2B award, taking equity stakes

Colossal Biosciences is growing chickens in a 3D-printed artificial eggshell

Show HN: I Made a Claude Skill for SDD

Kubernetes in Anger

Ask HN: Does anyone believe role-play AI is effective for training?

Building a Real-Time Chord Recognizer

Bees May Be Killing the Plants They Feed From

Lovable's AI built a 100% accessible site – or did it?

Send Money Anywhere – UMA

Tailwind: Suffering from Success

Wearable robot boosts strength of children with spinal muscular atrophy

You get a worktree, everyone gets a worktree

Google API will keys keep working after you delete them

OpenProse: Author Outcomes

Ask HN: If entry-level jobs are gone, does career change become impossible?

The Maintainers Dilemma

Designing a AI Access Layer for Systems of Record

Valgrind-3.27.1 Is Available

Swiss smart cities promise efficiency – at the price of your data

Air France and Airbus found guilty of manslaughter over 2009 plane crash

Show HN: Twixt – transform one word into another in four moves

Computing Reading List

Claude Orchestra – an org layer for your Claude Code skills/agents

Tesla Cybertruck driver arrested after driving into lake to use 'wade mode'

Apalache: Symbolic model checker for TLA+ and Quint

PhD student finds lost city in Mexico jungle by accident (2024)

European Parliament plenary debate on 'Stop Destroying Videogames' [video]