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?

Veta – AI agent that QA-tests Android apps

USA launches "Gold Eagle" clearinghouse for cyber defense

Inkling: A New Open-Weight 975B Moe with a Few Surprises

OpenAI's first gadget is the $230 Codex Micro macropad

Show HN: Free 30-second score of your website's traffic-to-sales path

Finding the Last Bottlenecks in json2xml with Flamegraphs

Ask HN: Assistive Tech Ideas for Dementia

Anthropic runs like Wile E. Coyote into the brick wall of consciousness research

Inventing Eliza: The First Chatbot's Hidden Code

How to publish to PyPI using GitHub Actions securely

AgentReady – MCP server that makes any docs site queryable by AI agents

TSMC plans further $100B US investment to feed AI demand

Memories are an anti-pattern for Claude Code

Why Am I Left-Handed?

Show HN: Fireplot – I built a take-home pay map to see if I should leave Belgium

GitHub banned my account after my projects suddenly spiked on Reddit

Beat the Couch

We built a customer support agent that learns

Greenland is losing so much ice that its gravity is getting weaker: researcher

Show HN: AI Law Tracker – one audited API for US, EU and global AI law

Show HN: SaaS isn't dead until we all stop using dbeaver

No Shark Is Safe: Shark Vacuums Are Vulnerable to RCE

Kimi K3 released on web and app

8% of images on Discord are scams: Blocking Mr. Beast scams

Interactive map predicts climate-driven farm decline by end of century

ReactBench – evaluation for coding agents on realistic React work

Micro Web-Framework for COBOL

Celestrak adds catalog digit, fixes Y2K bug

Show HN: Cortier – your AI negotiates dinner plans with your friends' AIs

How to spend 15 years perfecting a product