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?

Hacking Fiber to the Home

An Autonomous Framework for Systematic Factor Invest via Agentic AI

Show HN: NexusMem – local memory for coding agents, not just Git log

Who Is Cami Clark? Anthropic CEO's Wife Asked Epstein to Invest in Porn Business

Apple launches ads in Apple Maps for businesses across the US and Canada

Did the AI Bubble Just Pop?

Show HN: GPT, Claude, Gemini. Ask them all. Pay for one

Robots That Walk and Talk Are Coming to Car Factories

Patterns and Problems in Multiagent Systems

A Proposal to Fix Go's Proposal Backlog

Show HN: NoiseDrop – describe a place, hear it

Show HN: I spent 3 months making desktop automation stop lying to AI agents

Sexually transmitted infections are surging in Europe

Single-provider vs. multi-provider architectures for multimodal AI apps

Show HN: AI Meeting Assistant in Browser

France's constitutional authority strikes down social media ban for under-15s

Agents on Rails: The LLM Benchmark Project

Show HN: ThoughtDAG – An editable context graph for LLM conversations

Flink SQL vs. Flink Java API

Best US- and EU-hosted abliterated models with no input/output prompt retention

Instagzam and Other Logo Redesigns

The other Sean Byrne doesn't exist

Reconsidering O_CREAT|O_DIRECTORY

BibleMigo- where the Bible meets technology and game mechanics

App:Unforgetful

An Idea for a New Form of Media

Comma.ai Launches a PCIe Gen4 X4 to USB4 Dock with Open-Source Firmware

Best AI solution to hunt for buffer overflows in open source apps?

VTCode

Vivodyne launches largest human biological datacenter