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?

Oh My Open Agent

Ask HN: How are agentic workflows meant to offset AI debt?

Is SMS the last bastion of app fatigue?

OpenAI Guaranteed Capacity

Java: Rethink Domain Primitives with Valhalla

CloudNSite – AI agents that replace manual business processes for SMBs

Google's new Universal Cart wants to follow you across the internet

Google launches Antigravity 2.0 with an updated desktop app and CLI tool

Show HN: A macOS menu bar app for monitoring live Claude Code sessions and usage

Ask HN: Antigravity 2.0 installer breaks existing Antigravity IDEs

GhostTree: Unveiling Path Manipulation Techniques to Bypass Windows Security

Kickstarter Reverts Controversial Ban on 'NSFW' Projects

PoC: VPN over WebRTC to Bypass Whitelists

Poor Sleep Tied to Alzheimer's Risk in Older Women

What Is Happening to Publishing?

Small PR Rule Won't Survive AI

Zero: The Programming Language for Agents

RISC-V and Floating-Point

Shhh, Don't Put Secrets in the Repo

CPU OP Cache Corruption

Ask HN: Is grpcurl home page compromised?

Plex's 200% Lifetime Pass price hike tries forcing users to another subscription

Show HN: Bevel – Guess the book from its opening passage

Show HN: AgentKit SEO - a career context file that installs as agent skills

Show HN: YouTube MCP, give any AI agent access to YouTube

Biometric Surveillance in New York City

Built DealSensematch in 2 months. No team. No funding. Just me

Building the First AI-Native Hotel Booking Platform

I am not a Software Engineer

Understanding the Garbage Collector