Parsing IPv6 Addresses Crazily Fast with AVX-512
A new method for parsing IPv6 addresses using AVX-512 instructions has been developed, significantly improving speed. This approach processes over 70 million addresses per second, making it approximately 12 times faster than the standard inet_pton function. The technique leverages data parallelism to enhance performance while reducing the number of instructions executed.
- ▪IPv6 addresses are 128-bit and can be represented in a compressed format.
- ▪The AVX-512 routine outperforms inet_pton by parsing addresses at a rate of over 70 million per second.
- ▪This new method uses eight times fewer instructions than the traditional approach.
2 outlets in our directory ran this story, first to last over 18 hours. All of the coverage we found sits in one bucket: centre. That one-sidedness is itself worth noticing.
Hacker News (Newest) files mainly under programming. We currently carry 5,306 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | Daniel Lemire's blog |
| Canonical URL | https://lemire.me/blog/2026/05/23/parsing-ipv6-addresses-crazily-fast-with-avx-512/ |
| Publication time | Sat, 23 May 2026 06:44:16 +0000 |
| Retrieval time | 2026-05-23T07:07:25.403Z |
| Last seen | 2026-05-23T07:07:25.403Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | 9v1tElFECxwb · 2 stories |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
Parsing IPv6 Addresses Crazily Fast with AVX-512 Every machine connected to the Internet has an address called an IP address. Originally, these addresses were 32-bit integers (IPv4), giving a theoretical maximum of about four billion distinct addresses. We are all familiar with these addresses (e.g., 192.168.0.0). There was a big fuss about how we would run out of addresses. It never happened because we don’t actually need every device to have its own unique address. Your home router needs an address, but every device in your home does not need a worldwide unique address. Nevertheless, the range was extended to cover 128 bits (IPv6). An IPv6 address is conventionally written as eight groups of four hexadecimal digits separated by colons.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at Daniel Lemire's blog.
Discussion
0 commentsMore from Daniel Lemire's blog
