Block #902,569

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/20/2015, 11:18:31 AM · Difficulty 10.9397 · 5,907,129 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0af37c04a927b9921edd1a275d3b179d376b95541cdb1135998090f2c396fe9d

Height

#902,569

Difficulty

10.939701

Transactions

2

Size

1016 B

Version

2

Bits

0af09045

Nonce

864,331,584

Timestamp

1/20/2015, 11:18:31 AM

Confirmations

5,907,129

Merkle Root

7f09afb484f3c90201016d162b04dabc2e0050589f9141eec018bd81dd966b60
Transactions (2)
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.006 × 10⁹⁵(96-digit number)
30062834329599255014…34677543753009913601
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.006 × 10⁹⁵(96-digit number)
30062834329599255014…34677543753009913601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.012 × 10⁹⁵(96-digit number)
60125668659198510029…69355087506019827201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.202 × 10⁹⁶(97-digit number)
12025133731839702005…38710175012039654401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.405 × 10⁹⁶(97-digit number)
24050267463679404011…77420350024079308801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.810 × 10⁹⁶(97-digit number)
48100534927358808023…54840700048158617601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.620 × 10⁹⁶(97-digit number)
96201069854717616047…09681400096317235201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.924 × 10⁹⁷(98-digit number)
19240213970943523209…19362800192634470401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.848 × 10⁹⁷(98-digit number)
38480427941887046418…38725600385268940801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.696 × 10⁹⁷(98-digit number)
76960855883774092837…77451200770537881601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.539 × 10⁹⁸(99-digit number)
15392171176754818567…54902401541075763201
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,721,661 XPM·at block #6,809,697 · 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.

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