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?

The Difference Between Rest and Idleness

We're combatting AI scams with security, legislation and more

XP-era Windows spotted haunting London's driverless railway

UK digital ID gets brain trust to 'challenge' ministers on policy

Google fires sueball at alleged Chinese phishers over AI-powered fraud ops

Tracking Wind Patterns Using 3D Mercator Map

Image Compression

AI agent on GitHub gives recipe for blueberry pie

An octagon on the White House lawn for Trump's 80th birthday, the nation's 250th

Ask HN: How to get access to GPT cyber or glasswing as a solo dev?

WhatsApp Claims It Thwarted an NSO Spyware Campaign

QodFlow – a Kanban board AI agents can drive via MCP

US Secretary of War Comments on Anthropic

Is there a name for the type of comments agents add where they leak the prompt?

Frontier Language Model Intelligence, over Time

Anthropic's Zero Trust for AI Agents Sets the Right Test. The Bearer Token Fails

LLMs Pre-Commodify Ideas

A collection of things that are not Arabic

On May the 4th, Let's Remember Why Fans of All Factions Love Star Wars (2016)

State Attorneys General Are Investigating OpenAI

Llama.cpp – Run LLM Inference in C/C++

P2claw – Peer-to-peer hosting for vibe coders

Immutable Collections for JavaScript

Show HN: A bunch of Apache2/MIT log generators

Show HN: I built 80 mini-games using Fable before it was shut down

Some Ethical Problems with AI

Boot making and mending including repairing, lasting and finishing (1898)

ReactOS (FOSS "Windows") achieves 3D-accelerated Half-Life on real hardware

Atlassian "Data Contribution"

Claude Code v2.1.172: Sub-Agents Can Now Spawn Sub-Agents