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?

Cohere and Aleph Alpha merge to create $20B AI giant

HDR as a new tool for graphic design

How SpaceX Streamlined the Raptor Engine

Microsoft AI chief calls out Anthropic's approach to AI consciousness

AI Helps Rich People More

Show HN: File that is both valid bash and PowerShell, and replaces curl – bash

Envoy: EU should not increase climate resilience at expense of Japan industry

Every story fades with time, except for one

Cohere, Aleph Alpha combine to target enterprise AI market

Charterra – a weekly world tour of local charts

Piddington migrant camp could be scrapped because of NEWTS

Every 21 minutes: my self-healing monitor took my business line down for 2 days

Facing Outrage, Flock Got Help from Group That Uses AI to Rally Support

We're releasing Kalypta, the first app to block AI notetakers in your meetings

1996 PC dial-up and early web simulator

Rust coreutils acknowledges copying of GNU GPL code

Free to Choose (1980) [video]

AI tool turns any paper into an 'agent' that can collaborate and answer queries

Almost-There

A small, extensible experimental embedded database in C++20

I'm building a read-only AWS cost optimization tool for startups

How to get into a flow state: the triggers that hold up, and what EEG says

Open source semi: Windrose puts its electric truck online, for free

Pew: Democrats more worried than Republicans about AI's impact on jobs

Litespeed – a local coding agent with multi-model workflows

River home to 500 crocodiles chosen as Olympic rowing venue

Nuclear Fusion's Moment of Truth

Kidney Transplantation in Highly Sensitized Persons After Car T-Cell Therapy

Show HN: On-device meeting transcription for iPhone (no cloud, no account)

HavenCo