Block #563,801

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/27/2014, 5:02:42 AM · Difficulty 10.9648 · 6,263,429 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1db6a367f672d25b29d11c045f065b0434f55afd273ad60530e435b6050a7491

Height

#563,801

Difficulty

10.964810

Transactions

2

Size

1.15 KB

Version

2

Bits

0af6fdce

Nonce

566,903,400

Timestamp

5/27/2014, 5:02:42 AM

Confirmations

6,263,429

Merkle Root

de813322e099ee19cd2316479d87e42cc18d249ba5668669b08c54074f88c8ee
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.530 × 10⁹⁷(98-digit number)
15302237582148636525…66535037244796241421
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.530 × 10⁹⁷(98-digit number)
15302237582148636525…66535037244796241421
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.060 × 10⁹⁷(98-digit number)
30604475164297273051…33070074489592482841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.120 × 10⁹⁷(98-digit number)
61208950328594546102…66140148979184965681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.224 × 10⁹⁸(99-digit number)
12241790065718909220…32280297958369931361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.448 × 10⁹⁸(99-digit number)
24483580131437818440…64560595916739862721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.896 × 10⁹⁸(99-digit number)
48967160262875636881…29121191833479725441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.793 × 10⁹⁸(99-digit number)
97934320525751273763…58242383666959450881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.958 × 10⁹⁹(100-digit number)
19586864105150254752…16484767333918901761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.917 × 10⁹⁹(100-digit number)
39173728210300509505…32969534667837803521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.834 × 10⁹⁹(100-digit number)
78347456420601019010…65939069335675607041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.566 × 10¹⁰⁰(101-digit number)
15669491284120203802…31878138671351214081
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,861,940 XPM·at block #6,827,229 · 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