Skip to contentSkip to content
Verified credentials. On-chain. Forever.Learn more
Ewance
Sign in
Cover image for Bloom Filter Cache to Cut Origin Load at a CDN Edge
Code

Bloom Filter Cache to Cut Origin Load at a CDN Edge

FreeVerified credential3 weeksAdvanced

Overview

What this challenge is about.

Compute optimal Bloom filter params for a CDN edge, implement in Go, and measure false positives. You deliver the code and a verifiable certificate.

The scenario

The CDN (around USD 180M ARR, 90 edge points-of-presence) sells on origin-egress savings — a 10 percent reduction in wasted origin lookups is roughly USD 100k/month back to gross margin.

CredentialBlockchain-anchored
ShareableLinkedIn-ready
LanguageEnglish
PaceSelf-paced

The Brief

What you'll do, and what you'll demonstrate.

Design and benchmark a Bloom-filter front for an edge cache that eliminates at least 90 percent of negative-result origin lookups at a 1 percent false-positive rate.

Earning criteria — what you'll demonstrate

  • Derive Bloom filter parameters (m, k) from a target false-positive rate
  • Apply Kirsch-Mitzenmacher double hashing to avoid k independent hash computations
  • Measure observed-vs-theoretical false-positive rate on real workloads
  • Reason about probabilistic data structures as a memory-vs-accuracy trade

Program Fit

Where this fits in your program.

Sharpens the same skills your degree expects you to demonstrate.

Randomized Algorithms

Master · Algorithms

Strong alignment

This challenge maps to Randomized Algorithms at the Master level. It sharpens the same practical skills your coursework expects — but in a real industry context with actual constraints and deliverables.

One more thing

You can put a credential on your CV by Friday.