Block #502,282

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/20/2014, 7:47:27 AM · Difficulty 10.8071 · 6,314,652 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
91cd288a07e220ec91eeb8abfd75799f302eb7b92f151461fc9f188b4176dd3c

Height

#502,282

Difficulty

10.807129

Transactions

2

Size

730 B

Version

2

Bits

0ace9ffc

Nonce

81,553,037

Timestamp

4/20/2014, 7:47:27 AM

Confirmations

6,314,652

Merkle Root

08685ddc25f585b9c491f992f02754a8fada4216948f690fdc8472b340e1a195
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.

1.980 × 10⁹⁸(99-digit number)
19804779711166854868…40132541412814073601
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
1.980 × 10⁹⁸(99-digit number)
19804779711166854868…40132541412814073601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.960 × 10⁹⁸(99-digit number)
39609559422333709737…80265082825628147201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.921 × 10⁹⁸(99-digit number)
79219118844667419475…60530165651256294401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.584 × 10⁹⁹(100-digit number)
15843823768933483895…21060331302512588801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.168 × 10⁹⁹(100-digit number)
31687647537866967790…42120662605025177601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.337 × 10⁹⁹(100-digit number)
63375295075733935580…84241325210050355201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.267 × 10¹⁰⁰(101-digit number)
12675059015146787116…68482650420100710401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.535 × 10¹⁰⁰(101-digit number)
25350118030293574232…36965300840201420801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.070 × 10¹⁰⁰(101-digit number)
50700236060587148464…73930601680402841601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.014 × 10¹⁰¹(102-digit number)
10140047212117429692…47861203360805683201
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,779,514 XPM·at block #6,816,933 · 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