Block #563,123

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/26/2014, 5:49:17 PM · Difficulty 10.9648 · 6,246,491 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
50c381e9dc6219376afbb4a11c398c9a1b8ab721894e90ccce556c9790d303c6

Height

#563,123

Difficulty

10.964755

Transactions

4

Size

1.01 KB

Version

2

Bits

0af6fa2b

Nonce

729,596,334

Timestamp

5/26/2014, 5:49:17 PM

Confirmations

6,246,491

Merkle Root

70b540bbc39b5c4fc045e1326d151ecd9c381c651b4019a1e673a0f4938549d1
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.

7.990 × 10⁹⁸(99-digit number)
79904469207793471241…09216491283441805441
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
7.990 × 10⁹⁸(99-digit number)
79904469207793471241…09216491283441805441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.598 × 10⁹⁹(100-digit number)
15980893841558694248…18432982566883610881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.196 × 10⁹⁹(100-digit number)
31961787683117388496…36865965133767221761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.392 × 10⁹⁹(100-digit number)
63923575366234776993…73731930267534443521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.278 × 10¹⁰⁰(101-digit number)
12784715073246955398…47463860535068887041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.556 × 10¹⁰⁰(101-digit number)
25569430146493910797…94927721070137774081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.113 × 10¹⁰⁰(101-digit number)
51138860292987821594…89855442140275548161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.022 × 10¹⁰¹(102-digit number)
10227772058597564318…79710884280551096321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.045 × 10¹⁰¹(102-digit number)
20455544117195128637…59421768561102192641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.091 × 10¹⁰¹(102-digit number)
40911088234390257275…18843537122204385281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.182 × 10¹⁰¹(102-digit number)
81822176468780514551…37687074244408770561
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,720,989 XPM·at block #6,809,613 · 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