Block #287,551

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/1/2013, 9:05:40 AM · Difficulty 9.9868 · 6,519,564 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bff29c492ed47d430bdbafc6d18f6a004e655a543c58ace035dd51ee9d920e6e

Height

#287,551

Difficulty

9.986786

Transactions

1

Size

1.05 KB

Version

2

Bits

09fc9e09

Nonce

63,299

Timestamp

12/1/2013, 9:05:40 AM

Confirmations

6,519,564

Merkle Root

8ec6d55c8b15c08f712d6f02b84bda52ee3e9dab38815a59834dd0156663d879
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.028 × 10¹⁰¹(102-digit number)
10280056752919404059…95701409091146577921
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.028 × 10¹⁰¹(102-digit number)
10280056752919404059…95701409091146577921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.056 × 10¹⁰¹(102-digit number)
20560113505838808119…91402818182293155841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.112 × 10¹⁰¹(102-digit number)
41120227011677616238…82805636364586311681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.224 × 10¹⁰¹(102-digit number)
82240454023355232476…65611272729172623361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.644 × 10¹⁰²(103-digit number)
16448090804671046495…31222545458345246721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.289 × 10¹⁰²(103-digit number)
32896181609342092990…62445090916690493441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.579 × 10¹⁰²(103-digit number)
65792363218684185980…24890181833380986881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.315 × 10¹⁰³(104-digit number)
13158472643736837196…49780363666761973761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.631 × 10¹⁰³(104-digit number)
26316945287473674392…99560727333523947521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.263 × 10¹⁰³(104-digit number)
52633890574947348784…99121454667047895041
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,701,022 XPM·at block #6,807,114 · 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