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?

Verbalizable Representations Form a Global Workspace in Language Models

Anthropic's Claude Cowork heads to the cloud

Supamachine: A Deterministic State Machine for Supabase Authentication

purego: A library for calling C functions from Go without Cgo

Owning Inference on a DGX Spark: Qwen3.6 27B writing code that ships

Aviation Gazetteer – comprehensive list of aviation museums in the UK

What We Should Learn from Nordic Happiness

Volvo Is Bringing Native Apple Music to over Two Million Cars

The scientists trying to refreeze the Arctic

Show HN: Rama 0.3 release (5 years in the making)

Show HN: Traceval

RestoreKit: Recover a Mac in one click from any platform

The (Petty) Reason We Didn't End Up Using Jj

Show HN: I wrote a 1-bit WebGPU runtime to run a 1.7B LLM in the browser

Reintroducing John Witherspoon: Interstate Relations in Revolutionary America [pdf]

Show HN: Humanize – Best static AI text humanizer, based on 50 research papers

The Bizarre Flaw in the New Orleans Levees

B.C. 'preparing legal action' against OpenAI

British 'First Fleet' brought smallpox to Australia–and may have killed millions

CNN and CNBC promote gambling to make a cheap buck

The foundational elements of AI architecture that IT leaders need to scale

Sure, Your Claude Is Doing Amazing Things. Prove It

Life with Hazard Ratios

...

I have an interesting idea to reduce the output tokens almost by fifty percent

Show HN: FlowHook – a file watcher that knows if your build passed or failed

Automated Moderation Is Here to Stay

New Literalism Comes for Museums

Canada to buy 12 hi-tech German submarines after bidding war

Amor Fati Entropy