← Hall of Foundations Exhibit 150 · y² = x³ + ax + b
A Gentle First Look

Adding points
on a curve

Before elliptic curves become the engine of modern cryptography, they are just a graceful loop with one surprising trick: you can add two points on the curve and land on a third. This exhibit introduces that trick slowly, by hand, over the ordinary real numbers.

Start here. If the finite-field version felt like a jump, this is the on-ramp. Same rule, but drawn smoothly so you can see the geometry before it hides inside a field.
§1

Not an ellipse

A nonsingular Weierstrass cubic, together with its point at infinity, defines the group shown here. Its real points form a smooth symmetric plot; the number of connected components depends on the coefficients. The name comes from elliptic integrals, not from being an ellipse.

y² = x³ + ax + b
§2

The chord-and-tangent rule

To add points P and Q: draw the line through them, find the third point where it meets the curve, and reflect that across the x-axis. The reflection is P + Q. Tap two points and watch the construction draw itself.

y² = x³ + x + 1 · tap the curve
tap once for P, again for Q. The chord, the third intersection, and the reflection to P+Q all draw in vermilion. Coordinates are computed from the real group law.
Keyboard alternative: choose two points on the curve to add.
§3

Why an addition at all?

This rule isn't arbitrary — it turns the points of the curve into a group, with all the structure that word carries: an identity (the "point at infinity"), inverses (the reflection), and associativity. That group is exactly what cryptography moves into a finite field to build keys on.

The group law supplies arithmetic. Security requires suitable finite-field parameters and a complete protocol.

The construction drawn above also has exceptional cases: two points sharing an x-coordinate have no chord with a finite slope, and a point added to itself needs the tangent instead. Any implementation must branch on those cases, or use complete addition formulas that are correct for every pair without branching — a guarantee stated for a particular curve class, not for curves in general. Whether a correct formula was implemented correctly, and whether the compiled result runs in constant time, are two further questions that a correct formula does not settle. Four different promises about the same addition sets them side by side.

Where this leads

Two doors from here

Follow this into Finite Fields to watch the corresponding arithmetic over a finite field. A scatter plot alone does not demonstrate discrete-log hardness. Or follow it up into The Ground Beneath the Curve to meet the deep number theory of why these curves are so astonishingly well-behaved.

Applied in: ECDSA — this same chord-and-tangent group law, moved to a finite field, signing TLS certificates and blockchain transactions. The expression dG means scalar multiplication: repeated group addition, computed efficiently using methods such as doubling and addition.