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?

Show HN: Can AI read your mind?

Everything New in OpenCode 2.0

It Could Be Otherwise: Science in the Age of Uncertainty

Show HN: AI Hub – Open Access Lesson Plans for Teaching Students about AI

Show HN: The LAST DOOR – a tiny game about deciding when to leave

Borrowing Strength (Drug Dosing)

Show HN: PDF to ePub Conversion Tool for Mac

Apples to Apples: Getting Type Mappings Right in LLM-Based Code Translation

Learning What to Investigate Next: Meta-Reasoning for Long-Horizon Agents

KBEmacs, MIT's Programmer's Apprentice, Reanimated

Ask HN: Where has creativity in software gone?

Show HN: Built a Rome City Builder

DOJ arrests 2, seizes 187 devices in North Korean laptop farm crackdown in Texas

I built a tool to track what AI leaders say and how their views change on video

High-speed video reveals how honey bee stingers pump venom

Character.ai files for Chapter 11 bankruptcy. Disney makes a bid

The Feeling of Power

1 in 8B: A Life Simulation Game

Fine-tuning decision models – Server Logs and IoT Fleets

Show HN: Using the long book of the law to improve PA health insurance appeals

Do Frameworks Matter Anymore?

Who Decided AI Gets to Have Feelings?

A recent doubling of global warming rate signals a 1.5°C breach by 2028

Topgolf saved over $11.3M after leaving VMware

Creating a Garmin "MCP"

The Machines That Make the Machines

U.S. Treasury Announces Record Enforcement Actions Against Bank of America

HN: Encrypted Privacy Aware Emails, ZyMail Hit the Globe

Ask HN: Could you find funding if you didn't want to build a $1-10B business?

AI, Hyperwar and End Times Fascism