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?

OVS and OVN Explained: The Networking Stack Behind OpenStack

Ransomware negotiator hired to represent victims was working for the attackers

Show HN: TokenDrift – find hardcoded colors/spacing hiding in your CSS

Pharmacology Simulation Game

Show HN: Made a website for downloading EU and US LiDAR scans and terrain models

Popnix – A Xonix-style land-grab played on 3D bubblewrap

The Winners of the AI Era

Show HN: AgentTransfer now lets agents self-sign-up and get web app hosting

Show HN: Level – a new demo for 8bit Atari XL/XE

10 years of Pokémon Go and the millions still trying to catch 'em all

New NSF policy would ban almost all collaborations with Chinese scientists

Rumi's Masnavi

Is reading others' experiences like a spoiler to life?

Rewisp – An ambient screen memory for macOS that never writes images to disk

Backtrack-Free Cursive

Actor Sam Neill has died

Show HN: Monitor any website, discuss outages, and post verified owner updates

Giving "AI slop" as feedback says as much about the commenter as the creator

Show HN: Another terminal UI for stock, but with news sentiments

Pg_re2: 9x faster regular expressions in Postgres

Telstra CEO 'deeply sorry' for outage, admits risk of time-keeping failure known

Sam Neill Has Died

BoardUI

The Gran Turismo Magazine Beyond the Apex

The Reverse Information Paradox

Ask HN: What was the initial reaction to search engines?

SpaceX's near-term AI payoff seen tethered to Earth, not outer space

The Unreasonable Effectiveness of LLMs in Mathematics

Revisiting "The Great Mathematical Sputnik of 1979"

The Graph That Should Be Front-Page News