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?

What makes soccer so enjoyable to watch?

Shapeshifting

Arbitration Information

Free Remote Desktop Without Servers

Tahr Security Skills

SQLite: The Advantages of Flexible Typing

Photo of Lionel Messi with Lamine Yamal as a Baby (2024)

Hamilton council votes down bylaw – No ban against data centre development

The New Private Asset

Show HN: Resultant Engineering Student Tools Site

Show HN: MasterVault: Stop your LLM's context file from growing stale

AIcss: UI Components for AI Agents

Show HN: Throttle – Local Claude Cockpit for macOS, now with remote control

Asymmetric Apologies

OpenAI is bow everything it promised not to be: closed-Source & for-profit (2023)

Test-time training 3D reconstruction

Launching cdbx.ai with 50% off Pro Plans

I created S8sskills.com, an open source repo for serverless agent skills

End-to-end encrypted secret sharing with the Web Crypto API

Bridging the Gap Between Latent and Explicit Reasoning with Looped Transformers

B.Y.O.A. – Bring Your Own Agent [video]

IDPFlare – Identity Provider Built for Cloudflare

Hedge Fund Giants Have a New Profit Engine: Their Smaller Rivals

Aval: New open-source format for interactive video on the web

Rusefi – GPL internal combustion engine ECU

Back Up

UI-Skills

11,700 Free Photos from John Margolies' Archive of Americana Architecture

Linus Torvalds "Linux is not one of those anti-AI projects"

Lhv.ai – Estonian bank AI integration via MCP