Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•8mo ago

Comments

nine_k•8mo 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•8mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•8mo ago

They mention this in the article.

spockz•8mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•8mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•8mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•8mo 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•8mo 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•8mo 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•8mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•8mo ago

This was very well written. Excellent article!

NetOpWibby•8mo ago

Is this like MessagePack for Haskell?

Data is not available upon request

I Graduated from Survival Mode

The Pentagon used a secret aircraft painted to look like a civilian plane

Verizon to stop automatic unlocking of phones as FCC ends 60-day unlock rule

A 'Holy Grail' Sleep Apnea Pill Could Be on the Market Next Year

Great code doesn't matter if you can't sell it

FCC revises Verizon phone unlocking rules after significant fraud issues

Canada's Scaling Problem Isn't Compute, It's Coastlines

Show HN: Minimal type-safe language for software architecture

Bug 55867 – Doesn't know how to tag XI_TRACKBALL

From Starbase: Pete Hegseth on Defense Innovation Reform [video]

Meta shakes up its review system with 'stronger rewards for top performers'

Paramount Wants Warner to Show Its Work

Turning Agents into Learning Machines

DJT Says Microsoft to Make Changes to Curb Data Center Power Costs for Americans

Living with LLMs Everywhere – How Ambient LLMs Negate Security Policy

Who Companies Call When They Want to Become a Bank

Apple: You (Still) Don't Understand the Vision Pro

Show HN: Idlen.io ($IDL), the first privacy-first AI ad network is launched

Ask HN: How are you using AI to self-augment?

Show HN: I built a tool to calculate the True Cost of Ownership (TCO) for yachts

Sherlock MCP server so you can use AI to do OSI research

Picao AI Landing Page

Meta Taps Trump Alum as New President

Ackman Pitches Prepayment Penalties as Way to Cut Mortgage Rates

Mystery: Why do some LLMs produce more coil noise on Mac Studio M3 Ultra?

I'm a Happy Engineer Now

Spy Shots Catch the Strangest New Car We've Seen Since Cybertruck

Phind Is Shutting Down

Is life a game?Philosopher C. Thi Nguyen argues that play is the meaning of life