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?

Ask HN: How many bots do you think there are on this forum?

Show HN: I made a portals physics engine to prove my point

What 3,060 AI tools state about GDPR and EU data hosting (monthly, rule-based)

Free SEO site audit tool

Cometary impacts an unlikely pathway towards the origins of life on Earth

Free Scholarship Test – Data Science with AI

A vasomechanic treatment to increase the efflux of human brain proteins

AI Nutrition Labels, a New Tool Measuring AI's Impact on Human Wellbeing

AI agents hallucinate prices: LLM grounding with live data

Show HN: Yopologame.com – A free, bot-proof human proximity ledger

Major test for Australia's social media ban begins in High Court

An excavator dig cycle in the browser, timed by oil flow instead of keyframes

Trim - local proxy that compresses coding prompts before they reach your LLM

Training a handwriting recognizer on almost no real data

Being of Use to Someone

Toyota confirms Celica will return to WRC in 2027

Show HN: GhostLaunch – stealth wallet distribution for Pump.fun launches

A Big Ball of Mud

Raw Mathematics

How to export Grok to pdf [video]

Show HN: Hacker News Analytics

AI Red Team Academy: Free, open-source course on breaking AI systems

Show HN: Count Anything using AI, for shops, people objects, crowd

Show HN: DevShelf Free, zero-paywall directory of 565 dev tools and MCP server

I treated Sophie as if she were human. The next day she betrayed me

Lovable AI Apps Expose User Data Online

Python Typing Survey 2026: AI Tools and the Shifting Checker Landscape

Parasoft Alternative to API Service Virtualization

Price rises for some 16GB Raspberry Pi products

Anthropic Verification Records Outnumber OpenAI's Nearly 2 to 1 in European DNS