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?

Thoughts on memory layers like mem0

Codex is deprecating plan mode

Hacker News Daily

TingLongWu – local, offline meeting translation (listen and speak)

Show HN: Diagnosed with diabetes at 16, I built Diabic for World Diabetes Day

Terence Tao and Peter L.: Live Math with Open Math OS [video]

Blog on Multiagent Interaction Protocols

Show HN: Kasa, simplest budgeting app you can find

Open Source Motorcycle Infotainment

Most of AI moats are just fuel

Gitly: lightweight, self-hosted GitHub/GitLab alternative written in V

A Pile of MCP Connectors Is Not a Context Engine

Leo gets a birthday bash, 75 years after clocking in

Turn any image into emoji art, in the browser

Show HN: Vantage-V-AI – 2-bit ternary KV-cache with attention sinks

Periodic-Oriented Programming for First Robotics

Skyfall Attack: Microarchitectural Data Sampling on AMD

Israel: Making the Holy Land Burn

Show HN: Can a VPN be decentralised.. I think it's the best for homelabs

Proof Number search: exhaustively search a game tree to prove win or lose

India's voter-roll software flags twins but lets two men be each other's father

King Æthelstan founded England in927. Why don't we celebrate that anniversary?

SS United States

Earliest known writing dates back over 40k years

The Christian Nationalists Have a Plan

My Adventure in Economics

A comprehensive guide to the bank of Nvidia

Inkling 2 Small Scores 31 on AAII v5.0.1, best-in-class among "US" open weights

Kessler Syndrome

Korea's top tax accountant exam scorer confesses to cheating with AI