Block #287,023

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/1/2013, 3:41:06 AM · Difficulty 9.9862 · 6,522,643 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6a90ba8c694f12a9ffe57683965fc886a1ea7639b862797b796b89a007e483cb

Height

#287,023

Difficulty

9.986226

Transactions

4

Size

876 B

Version

2

Bits

09fc7953

Nonce

46,716

Timestamp

12/1/2013, 3:41:06 AM

Confirmations

6,522,643

Merkle Root

ba2f0c7894d18782d15396dd3ed4178093d3cd041e28763a6776b3d813bba4a8
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.067 × 10⁹⁷(98-digit number)
30675484362205468091…66539302091508111361
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.067 × 10⁹⁷(98-digit number)
30675484362205468091…66539302091508111361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.135 × 10⁹⁷(98-digit number)
61350968724410936183…33078604183016222721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.227 × 10⁹⁸(99-digit number)
12270193744882187236…66157208366032445441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.454 × 10⁹⁸(99-digit number)
24540387489764374473…32314416732064890881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.908 × 10⁹⁸(99-digit number)
49080774979528748946…64628833464129781761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.816 × 10⁹⁸(99-digit number)
98161549959057497893…29257666928259563521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.963 × 10⁹⁹(100-digit number)
19632309991811499578…58515333856519127041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.926 × 10⁹⁹(100-digit number)
39264619983622999157…17030667713038254081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.852 × 10⁹⁹(100-digit number)
78529239967245998314…34061335426076508161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.570 × 10¹⁰⁰(101-digit number)
15705847993449199662…68122670852153016321
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,402 XPM·at block #6,809,665 · 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