Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•11mo ago

Comments

nine_k•11mo 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•11mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•11mo ago

They mention this in the article.

spockz•11mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•11mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•11mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•11mo 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•11mo 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•11mo 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•11mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•11mo ago

This was very well written. Excellent article!

NetOpWibby•11mo ago

Is this like MessagePack for Haskell?

Llama.cpp with CUDA Support on Original Jetson Nano (4GB)

LLMs on a PowerPC Mac

Show HN: WordGen, a fast and easy to use wordlist generator

Stop Guessing. Start Scaling. Land Your Dream Big Tech Offer with InterviewGPT

Show HN: NUPA is Pax Economica, 6,480x more stable than current US economy

Show HN: Live global gas station inventory

First evidence of birth assistance in non-primates filmed (whales)

Sora 2 API and Sora 2 Pro API

Code review skill inspierd by Gilfoyle and Dinesh

I Let AI Write My Code, but Not My Writing

The Machiavellian Maze

Pretext: JavaScript/TypeScript library for multiline text measurement and layout

Building shared coding guidelines for AI (and people too)

Scientists film whale giving birth while other whales work together to help her

Ada and Spark on ARM Cortex-M – A Tutorial with Arduino and Nucleo Examples

Poison AI Training Data Scrapers

Show HN: Local Vault – AES-256-GCM password manager in a single HTML file

Stop Calling Them VPNs (2024)

Ask HN: Best place to host a Node.js App in 2026

The Deliverable Is You Programming as Theory Building

Stop Calling Every AI Miss a Hallucination

Show HN: BillingEngine – usage-based billing for APIs with real-time rating

Play Anthakshari

101 Ads – Highway 101 Billboard Map

What happens when you clone mice for 20 years straight?

Atomic Rockets – Build your own spaceship

Show HN: Every Minute a Startup

What do frontier AI companies' job postings reveal about their plans?

Pi: The Minimal Agent Within OpenClaw

Show HN: VizTools – 16 free tools for PMs and freelancers, deliberately no AI