System designLoading progress…

Coursefy progress

Produce an end-to-end design whose data paths, capacities and failure behavior satisfy explicit requirements.

Coursefy progress

Published content is versioned and progress is tied to stable lesson ids. XP for a first completion must be idempotent: key the reward on (user, lesson, reward version) and award it once. If 100 learners finish the same lesson and every request is retried once, there are 200 deliveries but only 100 events: 2,000 XP is right, 4,000 is a bug. The dedup record and the XP change must share one atomic durable step, and merging a guest account must replay its events through the same rule so nothing is awarded twice.

learners completing the lesson100retries per request1
deliveries: 200 distinct events: 100 XP at 20 per first completion: 20 × 100 = 2,000 (correct) the dedup record and the XP change must be one durable, atomic step; merging a guest account replays its events through the same rule
Change the learners and retries; switch deduplication off.

Predict first. Is adding XP on every repeated completion request correct when XP is for the first completion?

Chapter context

A case study integrates choices into one coherent system. Start with a small requirement set, trace the important operations, calculate the dominant costs and stress the design with a failure before adding components.

Chapter reference: math, worked example & code

This section belongs to the whole chapter, so it is the same on every lesson in it and may cover a different lesson's topic. The code for the experiment you just ran is inside the experiment itself.

Math and notation

For first-completion XP, define a unique logical event key such as (user_id, lesson_id, reward_version). Under a fixed reward r, XP=r×XP=r\times count(distinct eligible event keys). The deduplication record and awarded effect must share an atomic durable boundary in a real implementation.

Worked example

One hundred learners complete the same lesson, and every completion request is retried once. There are 200 deliveries but only 100 distinct learner-lesson events. At 20 XP per first completion, the correct total is 2000 XP, not 4000. The Python example models the invariant without pretending to implement distributed persistence.

Reference code

The following example uses the Python standard library and does not call a remote service.

deliveries=[]
for user in range(100):
    deliveries.extend([(user,'lesson-1','reward-v1')]*2)
unique=set(deliveries)
assert len(deliveries) == 200
assert len(unique) == 100
assert 20*len(unique) == 2000
assert 20*len(deliveries) == 4000

Python examples are provided for study and local execution; this page does not execute Python.

Common mistakes

A keyspace count does not prove collision freedom. Delivery and reading are different product events. Deduplication must cover both durable event identity and the actual effect.