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?

Eiffel Tower employees strike after female staff removed

Magic-mushroom compound blocks a side effect of chemotherapy in mice

Switching Password Managers in 2026

CivBench: A Long-Horizon Benchmark for Tool-Mediated Agents in Civilization VI

Agility Robotics reports $1.8M revenue ahead of humanoid SPAC

Generals – Conquer the live world map

Do tech billionaires dream of shared abundance? We should probably just tax them

Show HN: Typebook engage yourself in reading by painstakingly writing every word

Robot-Use Agents

Autistici.org Domain Taken Down

Web Import Master: rebuild a live web page as a Figma design with auto layout

Fx2-Cmix-Transformer

ToolHive Is Open-Source

AI crawler user-agents are being spoofed to reach cloud metadata endpoints

Where Good Decisions Don't Add Up

Navier-Stokes – Tristan Buckmaster [pdf]

Famous Unsolved Math Problems as Homework(2015)

'Global reckoning for big tech': Australia to force opt-out of social algs

An AI that talks like a friend, jumps in, interrupts and keeps the convo going

Electrostatic Cathode Ray Tube Project 1 (2014)

Multi-Agents LLM Financial Trading Framework

I scraped 10,555 ivf rounds rounds from forum posts around the world

Clean Web-to-Markdown: Fast HTML Extraction for LLMs and RAG

What may happen in the next hundred years?(1900)

My Feed, My Way

KDE's new Photos app offers a sleek alternative to Gwenview

Mistral raises €3B to make sovereign, open-weight AI the technology frontier

The 100x Engineer Certification

Ask HN: Best Platforms to Orchestrate Agents

How One Connection Kills a Database