Block #471,558

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/2/2014, 4:24:33 PM · Difficulty 10.4332 · 6,342,574 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b0595b204aba1aadd3b37fabff6fab67bd019dcfc52804690accb603f15f878e

Height

#471,558

Difficulty

10.433176

Transactions

1

Size

974 B

Version

2

Bits

0a6ee4a0

Nonce

28,764

Timestamp

4/2/2014, 4:24:33 PM

Confirmations

6,342,574

Merkle Root

1549bce2adca86b6dd23724d9b3884bf48c2a95194c2cf7c528024d344132aaa
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.

3.878 × 10¹⁰⁵(106-digit number)
38789651113070629304…98236317247858023201
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
3.878 × 10¹⁰⁵(106-digit number)
38789651113070629304…98236317247858023201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.757 × 10¹⁰⁵(106-digit number)
77579302226141258609…96472634495716046401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.551 × 10¹⁰⁶(107-digit number)
15515860445228251721…92945268991432092801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.103 × 10¹⁰⁶(107-digit number)
31031720890456503443…85890537982864185601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.206 × 10¹⁰⁶(107-digit number)
62063441780913006887…71781075965728371201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.241 × 10¹⁰⁷(108-digit number)
12412688356182601377…43562151931456742401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.482 × 10¹⁰⁷(108-digit number)
24825376712365202755…87124303862913484801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.965 × 10¹⁰⁷(108-digit number)
49650753424730405510…74248607725826969601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.930 × 10¹⁰⁷(108-digit number)
99301506849460811020…48497215451653939201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.986 × 10¹⁰⁸(109-digit number)
19860301369892162204…96994430903307878401
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,757,139 XPM·at block #6,814,131 · 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