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?

Show HN: A 3D sky city where my Claude Code agents work and take coffee breaks

Don't Feed the AI

Show HN: GPT-3.5 answered, GPT-4 voided; I built an EOS gate for AGI

Intel Accelerates Open Infrastructure for the Agentic AI Era

Measure a Workflow, Not a System

Show HN: Open Health Sync – Self-hosted API for wearable and health data

Why agents lose the plot on large or legacy codebases

FBI arrests Canadian cybersecurity expert in ShinyHunters hacking case

Costa Vayenas, Insights from "The Swiss Franc 1798 – 2055" [video]

Fork-and-Flush: Escaping Idea Basins in Autoresearch Agents

Stateless Language Agents: Scaling Long-Horizon Automated Research

When should an agent own the control flow?

Trader Nets $1.28M on Papertrade as 1,000x Leverage Raises Risk Questions

PhoneBot: A Low-Cost Open Humanoid Robot Platform Reusing Smartphones

Eliminating a gut microbe could slash gastric cancers (2024)

J Spalletta Convicted for Defrauding Crypto Exchange of $50M in Hacks

AI Mentions Checker: Track Your Brand Visibility in AI Search

NFL Big Data Bowl 2027

Harpie – A local SSH key manager for Windows

Why the Nobel Prize in Economics Went to Robert Hall and Michael Woodford

Show HN: Search for AI agents with usefulness score built in

Subagents, Forks and Collapsing Context

dont Show HN:we made betr Moltbook alt thecollectives.dev social media/AI agents

OpenCode 2.0

Can we change an AI model's architecture without retraining it from scratch?

Barbed Wire Telephone: How Farmers Turned Fences into Phone Lines

Show HN: Malleable video editor that adapts to your workflow

Show HN: vne – .env util for agents

Show HN: ClaudeGuard – fixes the MSIX bug that nukes your Claude Code history

Show HN: RL environment for complex ML Development