Block #560,931

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/25/2014, 4:43:34 AM · Difficulty 10.9649 · 6,247,098 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2166be371eb68da86f6774fd2eaa485cd53a7818ecf1ae5e4dec3270ddb2a3b3

Height

#560,931

Difficulty

10.964924

Transactions

8

Size

1.75 KB

Version

2

Bits

0af70547

Nonce

332,262,401

Timestamp

5/25/2014, 4:43:34 AM

Confirmations

6,247,098

Merkle Root

93d9f24c687132416a579a7e5a82b7702fe1d40da7cff884d57f901e4b94ca7e
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.737 × 10⁹⁹(100-digit number)
17375731448320181820…31266186299066855199
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.737 × 10⁹⁹(100-digit number)
17375731448320181820…31266186299066855199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.475 × 10⁹⁹(100-digit number)
34751462896640363640…62532372598133710399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.950 × 10⁹⁹(100-digit number)
69502925793280727280…25064745196267420799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.390 × 10¹⁰⁰(101-digit number)
13900585158656145456…50129490392534841599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.780 × 10¹⁰⁰(101-digit number)
27801170317312290912…00258980785069683199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.560 × 10¹⁰⁰(101-digit number)
55602340634624581824…00517961570139366399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.112 × 10¹⁰¹(102-digit number)
11120468126924916364…01035923140278732799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.224 × 10¹⁰¹(102-digit number)
22240936253849832729…02071846280557465599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.448 × 10¹⁰¹(102-digit number)
44481872507699665459…04143692561114931199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.896 × 10¹⁰¹(102-digit number)
88963745015399330919…08287385122229862399
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,708,276 XPM·at block #6,808,028 · 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