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?

Turso Now Includes Unlimited Active Databases for Everybody

LiteLLM Agent Platform: Run Claude Code/Codex On-Prem Sandboxes and Vaults

New Nightmare Just Dropped: '3D' Animated Ads on Trucks in Traffic

Terence Tao: New Mathematical Workflows – Future of Mathematics

NASA Captures Volatile Changes in Earth's Artificial Light

Second Automaker Sounds Alarm over Dwindling Motor Oil Stock

Show HN: Epiq – Distributed Git based issue tracker TUI

NYT and Vaping: How to Lie by Saying Only True Things

AGI and the Future of Reasoning – Future of Mathematics

Ken Liu on AI and Freedom

Amazon pressured one of its teams to develop an AI game: Project Trident

Conscience-Performance Risk in AI Governance Language

We Can Now Read What Claude Is Thinking. Kind Of

Crystals found inside wreckage from the first nuclear bomb test

Google explains why some new Gmail accounts only get 5GB storage

World’s first native color LiDAR gives machines human-like vision

We built an agent specialized for CI (using the 3 Claude models)

I recreated the experience of reading the morning sports section

ExploitGym: Can AI agents turn bugs into exploits?

The main thing about P2P meth is that there's so much of it (2022)

Context Forking to Save Time, Tokens and Trouble

Show HN: Pico-intl – Type-safe internationalization with CLI localization gates

Gas Stations Under Attack

Erlang/OTP 29.0

Urlsify.com Free (forever) Link shortener with Analytics

Broken windows theory

Ghost Job Detector – AI that decodes fake job posts and HR lies

NASA-cleanroom microbial isolates survival in simulated space/Martian conditions

Colorado governor commutes sentence of election denier Tina Peters

SQL patterns I use to catch transaction fraud