---
title: "Discussion on \"How Structural Sharing Makes Immutability Fast\" | Hashnode"
description: "Discussion on \"How Structural Sharing Makes Immutability Fast\". Discover how 32-way bitmapped vector tries and structural sharing allow fast, memory-efficient updates to immutable lists without copying entire arrays."
url: "https://hashnode.com/posts/how-structural-sharing-makes-immutability-fast/6ac0c659694de8e645b1714e"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [How Structural Sharing Makes Immutability Fast](https://doogal.dev/how-structural-sharing-makes-immutability-fast?utm_source=hashnode&utm_medium=feed)

Discover how 32-way bitmapped vector tries and structural sharing allow fast, memory-efficient updates to immutable lists without copying entire arrays.

Oct 3 · 5 min read · doogal.dev  
Read the article

-   [#functionalprogramming](https://hashnode.com/tag/functionalprogramming)
-   [#datastructures](https://hashnode.com/tag/datastructures)
-   [#softwareengineering](https://hashnode.com/tag/softwareengineering)
-   [#computerscience](https://hashnode.com/tag/computerscience)

## Written by

[Doogal Simpson](https://hashnode.com/@doogal)

@doogal

  
[View profile](https://hashnode.com/@doogal)

"hey doogal, what is .... ?"

## Responses

Markdown supported · ⌘↵ to post

No responses yet.