5p1r

This is the second of a series of articles I’m trying out called “5 points & 1 resource” (think tl;dr but 5p;1r) where I summarize a list of bullet points that would have helped me start learning a new topic. It is intentionally far from a complete source of data. You can find the first one here: 5P;1R - Bitcoin’s Elliptic Curve Cryptography A Patricia Trie is a prefix tree where edge values are concatenated as you navigate down the tree to form a key associated with the node’s value. All leaf nodes must have a value while it remains optional for parent nodes. ...

This is the first of a potential series of articles I want to call “5 points & 1 resource” (think tl;dr but 5p;1r) where I summarize a list of bullet points that would have helped me start learning a new topic. It is intentionally far from a complete source of data. This is an Elliptic Curve: y^2 = x^3 + ax + b; see the continuous function Image 1. Elliptic Curve Cryptography is defined over a Finite Field (very large prime) p along with a **Generator Point **((x,y) coordinate) G like so: y^2 ≡ (x^3 + ax + b) mod p ; see the scatter plot Image 2. ...