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?

Wp2shell: Pre Authentication RCE in WordPress Core

Intel Starts Shipping High-NA EUV Silicon

Give Agents Homeplace via SSH

Why huge pages matter for Postgres?

IBM CEO Arvind Krishna Has Nowhere to Hide from AI

Sync.md – keep AGENTS.md, Claude.md, .cursorrules in sync by meaning, not diff

Against Mind-Blindness: Recognizing and Communicating with Diverse Intelligences [video]

Things I Won't Work With: Dioxygen Difluoride (2010)

Show HN: Waylou / a multi-provider CLI coding agent / fork of Gemini CLI

Tool to benchmark AGENTS.md file on swe tasks

Apple dethrones Nvidia to regain title of world's most valuable company

Tutorial: Introduction to Formal Verification with Lean (Part 1)

No President Has Embarrassed This Country the Way Trump Did Last Night

Valve's 14-Year Journey to Make the Steam Machine

World Models

Typing Speed Test, but for Developers

Kimi K3 Might Have Just Started a Crash of the US Economy

Taylor Farms Recall. 27 States and the List Includes Bags Sold in Grocery Stores

Jack Conte: Why I'm (sort of) not worried about AI [video]

Is there any need for low cost LinkedIn followup reminder solution

Show HN: Medows – an AI clinical workspace for doctors on ward rounds

Meta's new AI chips will begin production in September

Amazon invents the Attachment Economy bait-and-switch

I indexed 15,000 company hiring boards to search every (most) live tech jobs

/dev/tcp to do fast and light TCP health checks

Real-Time LuaTeX: Recompiling Large Documents in 1 ms [video]

Show HN: Firedeck – Firebase Console for iPhone and iPad

The Java Story, the Official Documentary

Spotify Deleted 75M AI-Generated Tracks – and It's Not Done Yet

Show HN: Typedeck – a Mac presentation app with a deterministic layout engine