Block #470,504

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/1/2014, 10:48:21 PM · Difficulty 10.4335 · 6,346,171 confirmations

2CC
Cunningham Chain of the Second Kind

A sequence where each prime is double the previous prime minus one.

Block Header
Block Hash
d169c35f1088f6f0b54ba6a67848099d4207e750f2632ae653e8e11fde19e28b

Height

#470,504

Difficulty

10.433515

Transactions

2

Size

1.41 KB

Version

2

Bits

0a6efad9

Nonce

3,671

Timestamp

4/1/2014, 10:48:21 PM

Confirmations

6,346,171

Merkle Root

617dbe8edf2ca89de0d3ab2016bf1c2bceff85ea0895fba9fdfc199ea4e9af99
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

5.502 × 10¹⁰³(104-digit number)
55020619742276576071…98965018576313950721
Discovered Prime Numbers
p_k = 2^k × origin + 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin + 1
5.502 × 10¹⁰³(104-digit number)
55020619742276576071…98965018576313950721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.100 × 10¹⁰⁴(105-digit number)
11004123948455315214…97930037152627901441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.200 × 10¹⁰⁴(105-digit number)
22008247896910630428…95860074305255802881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.401 × 10¹⁰⁴(105-digit number)
44016495793821260857…91720148610511605761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.803 × 10¹⁰⁴(105-digit number)
88032991587642521714…83440297221023211521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.760 × 10¹⁰⁵(106-digit number)
17606598317528504342…66880594442046423041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.521 × 10¹⁰⁵(106-digit number)
35213196635057008685…33761188884092846081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.042 × 10¹⁰⁵(106-digit number)
70426393270114017371…67522377768185692161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.408 × 10¹⁰⁶(107-digit number)
14085278654022803474…35044755536371384321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.817 × 10¹⁰⁶(107-digit number)
28170557308045606948…70089511072742768641
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Cunningham Chain of the Second Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★☆☆☆
Rarity
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,777,519 XPM·at block #6,816,674 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.
Privacy Policy·

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy