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?

Agentic Robotics Solves an Industrial Production Problem

Gloss – Annotate live code and provide feedback to an agent

ArXiv imposes rate limit on paper submissions to stem the AI slop tide

IINA 1.5.0

We Used Gas Town to Build a Wasteland – an honest remediation gastown log

G7 nations will release 100M barrels of oil and diesel fuel

Might be the best place to check your weather

Fedup with prison mails being returned

Pete Hegseth: Speech to the Troops

Show HN: Google Maps Scraper MCP

Shed Etching 3D Transistors for Homemade RAM [video]

Cydonia

Show HN: 80s Choplifter game ported to Vision Pro as an agent eval (WIP)

Slovenia's .si domain sees surge in registrations after 'super intelligence'

Sea Monkeys Show Scientists How to Rewrite a Rule of Turbulence

Can we predict the jobs robots will do?

Introversion DEFCON 20th anniversary edition

Pixora: A Python Library for Pixel Art Conversion

AI bots are flooding researchers with requests for money and time

Hair Loss Was Just the Start. Ozempic Users Are Also Reporting Nail Trouble

Math's pedagogical curse – Grant Sanderson [video]

The Mulleted, Meme-Loving Billionaire Behind Meta's Hit AI App

NTSB Preliminary Report: Prime Air 767 Runway Overrun [pdf]

What even are Cloudflare Durable Objects?

The Museum of All Shells – Every Shell Is the Same Formula [video]

Do not build the LLM torture factory

Underdog private personal on-device local AI for privacy and security

The Fastest Growing Market in Tech Isn't AI – Tomasz Tunguz

Newgrounds.com – A community of games, music, and art

There was a light that never went out