Packed Data Support in Haskell

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

77•matt_d•10mo ago

Comments

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

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

Zolomon•10mo ago

They mention this in the article.

spockz•10mo ago

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

cstrahan•10mo ago

No, one example of why being variable sized integers.

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

carterschonwald•10mo ago

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

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

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

lordleft•10mo ago

This was very well written. Excellent article!

NetOpWibby•10mo ago

Is this like MessagePack for Haskell?

Show HN: I built an open-source analytics platform for Claude Code sessions

People living in UK's poorest areas have less diverse gut bacteria, study finds

Housing: Rent vs. Buy Calculator Spreadsheet

I built a 151k-node GraphRAG swarm that autonomously invents SDG solutions

Regex is dead. We replaced it

OpenaAI: Disrupting malicious uses of our models [pdf]

The age of flat pack code

Ralph Wiggum Explained: Stop Telling AI What You Want – Tell It What Blocks You

Show HN: Relay – SMS API for developers (send your first text in 2 min)

Adonisjs v7 released (Next.js alternative)

You Just Need Postgres

Show HN: A minimal Claude Code clone written in Rust

Typing Fun Game

Smartphones, Online Music Streaming, and Traffic Fatalities

Secria Mobile – Post-quantum encrypted email, now on iOS and Android

Show HN: 20x – Open-source agent orchestrator for Linear/HubSpot tasks

Nobody Trusts Anybody Anymore

Tell HN: YouTube Subscription page is being deprecated

Any Open Source Contributors?

Show HN: Ask a graph database questions in plain English (runs in the browser)

Half of the side projects from HN make less than $1000 a month (2024-2025)

Palo Alto's $400M scanner labels 91% of confirmed OpenClaw threats safe

Show HN: OnGarde – Runtime content security proxy for self-hosted AI agents

Show HN: SAIA – SCUMM for AI Agents

SF Vibe House

Palm OS User Interface Guidelines [pdf, 2003]

Show HN: SkillFortify, a formal verification for AI agent skills

Microbial system to convert CO₂ into eco-friendly butanol

How to Close a Diamond Mine in the Northwest Territories

Anthropic is both too dangerous to allow and essential to national security