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?

What a 2019 API client teaches you about modern .NET

Wispr-clone – offline push-to-talk dictation for Linux

Show HN: BlurShield – Automatically blur sensitive info during screen share

TSMC eyes price hikes of up to 25% on chip production services in 2027

Hackercouch: Couchsurfing for Hackers, by Hackers

Show HN: Playwright end-to-end tests as OpenTelemetry spans

Show HN: Apotrope – Offline Windows security auditor (like Lynis, for Windows)

Intel Foundry nabs a custom ASIC win with Fortinet

Show HN: Tellie – the Mac teleprompter that follows the words you say

You might already have product-market fit

Show HN: Maith – open math research with AI

Show HN: TZRO – A Free Local AI Task Offloader

Show HN: Infrastructure Planning Software

Show HN: WiFi-LLM

Show HN: Mini Golf Club – a 3D multiplayer mini-golf game in the browser

Windows LegacyHive zero-day flaw gets free, unofficial patches

Cup Noodle releases cold-water instant ramen in Japan

AI physics on vacation turned into real research in quantum mechanics

Contra George Hotz on "AI 2040 and the Cult of Intelligence"

Mullvad and Daniel Berntsson's Failed Cleanup

OSS ChatGPT WebUI v4 – Projects, Agent Profiles, Server Tools, 1-Click Sharing

Garzed – my garden waters itself off soil-moisture sensors

Error Handling vs. Hiding Errors

An engineer's love letter to football

Ask HN: To lead with, or bury, AI in product marketing

Brazil and US clash as popular Pix system stirs global interest

AGI Singer: Full Saturday

Show HN: Neat, Static code and OTel fused into one graph for agents (OSS)

A Fireside Chat with Cat and Thariq from the Claude Code Team

Ask HN: Which model do you use with Pi coding agent?