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?

Pipelog – I kept losing track of what Claude Code did, so I built a log for it

The State of Agentic Memory

Jay Miner on the History of the Amiga [video]

Show HN: Self-Hosted Inference for Agents

Rogue AI agent hacks gym to get its user a spot in a popular class

An Approach to Technical AGI Safety and Security, DeepMind (GDM)

The lattice of sets of natural numbers is rich

HLSmith: An Expert-Guided Agentic Framework for C/C++-to-HLS Translation

Web Design for Terminal Browsers

XenDroid – Android Xbox 360 Emulator

AI's profits are 'being funded by investors rather than earned from customers

Call Stack Diffs

What Is Docker, and What It Silently Replaced

How to Use Podman for Home Lab Setup

How to Improve Your First Principles Thinking Skills

A Growing Threat: The Anti-Rights Movement in the UK (By Amnesty International)

How to Overcome Confirmation Bias

The BS That Is Generated by Wellness Apps

Failing After Success

OpenAI / Hugging Face Hack

Amazon DynamoDB now supports real-time vector search at any scale

Using AI to analyze life patterns

China is now the world's greatest oil power

Primus AI Researcher – Free

Colombia Hit by Magnitude 7.4 Quake, Widespread Damage Reported

Foxes, Lions, and LLMs: The Machiavellian Game of Tech Hiring

AI Fortunes Are Reviving an Old Debate About Private Power

The Final Third Football

Humanising LLM Outputs Is Dumb

Archer to Acquire Wisk, Insitu, and SkyGrid from Boeing