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?

5 Monitors on a Commodore 128 [video]

Ask HN: Anyone notice World Cup video feeds look like AI?

Be Realistic. Demand the Impossible

Show HN: MdFried, the Ultimate Markdown Viewer

Someone Build a OS for Claude Code

Cross-LIB – WORA for vintage devices

Show HN: A 'boggle-like' daily word game

Portfolio Covariance Optimization and Market Impact Capacity Engine

JSON-LD Explained for Personal Websites

Peakload Benchmarks for Operating Systems

Show HN: Gaming is YouTube bigges category and the least criticised we scored it

A cheaper and safer agentic AI workflow

I make good money. Why do I still feel like this?

Oasis Ambient – Wi-Fi LED Light Teardown

Tech pundit Cringely cofounds startup '2Brains Inc' to solve LLM hallucinations

List of Unusual Deaths

Open-source Vulkan driver NVK gains experimental DLSS support

How Old Are You in Space?

Flic Mic for AI – The Wireless Voice Button

The GLP-1 boom is the biggest climate story no one is pricing in

Tech Company Finder

MicroVM sandbox solves one problem well, but not the agent security problem

Netflix, A24 and Focus Pass on Luca Guadagnino's Movie 'Artificial'

Chatting with an AI Won't Make You a Top Programmer

MMTk – Memory Management Toolkit

Mark Zuckerberg wants to replace your phone with (10 years of work)

Why everyone is talking about real-time analytics

Polymarket reportedly paid people to post fake videos of themselves placing bets

Horus – Zero-dependency C++ CLI for malware IOC analysis and enrichment

Introducing ZSoftly Cloud Platform, a Canadian public cloud