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?

Addressing GitHub's recent availability issues

Plenty of Hours in the Day

Show HN: Kheeper, a registry designed for bootable images

Trump's Border Spending Spurs Boom in AI-Infused Surveillance

America the Undammed

University student arrested in Taiwan for radio hack that halted high speed rail

SmartScreen warnings triggered after migration from EOC. EV certs affected too

Open Source Volunteer Opportunities

SVG Frame-by-Frame Animation Generator

The Bottom-Up Building of a Language for Subleq with Text Macros

The Greatest Shot in Television: James Burke Had One Chance to Nail This Scene

Copilot Builder enables welding with AI

University Claims Withholding Water from Data Center 'Unlawfully Discriminatory'

I Got Tired of Rewriting Prompts So I Built This

Trusted Computing Frequently Asked Questions (2003)

SzPredict – open seizure prediction benchmark (all 6 baselines fail)

Remove/replace links pointing to GNOME Calendar, and update branding

Singapore Foreign Minister to Keynote AI Engineer Singapore

Making cross-platform SIMD code pleasant

Today Is World Password Day

BSides Austin Is on Hold

Recursive Multi-Agent Systems

What can singing mice say about human speech?

Ask HN: How have you spent time outside work for the past couple of weeks?

Up in Smoke

Apple's privacy invading tech is likely going mainstream

Robot Dogs Are a Security Nightmare [video]

A Job at OpenAI Became the Greatest Lottery Ticket of the AI Boom

Brain motion is driven by mechanical coupling with the abdomen

Stack of 500: 500 Production-Tested AI Prompts