Block #553,030

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/19/2014, 9:11:20 PM · Difficulty 10.9629 · 6,263,010 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
85e9880ee8d0fca8768b063cf6ffb6a07fa052777cabb9c675178f6e5e67cd3a

Height

#553,030

Difficulty

10.962893

Transactions

5

Size

1.09 KB

Version

2

Bits

0af6802c

Nonce

341,052,415

Timestamp

5/19/2014, 9:11:20 PM

Confirmations

6,263,010

Merkle Root

b129cb8a2e6fed653c5c37657db1225b05ce1b3e32a74e8cd113293059e6a1ca
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.920 × 10⁹⁸(99-digit number)
79208706354212536085…37210512598319258881
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.920 × 10⁹⁸(99-digit number)
79208706354212536085…37210512598319258881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.584 × 10⁹⁹(100-digit number)
15841741270842507217…74421025196638517761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.168 × 10⁹⁹(100-digit number)
31683482541685014434…48842050393277035521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.336 × 10⁹⁹(100-digit number)
63366965083370028868…97684100786554071041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.267 × 10¹⁰⁰(101-digit number)
12673393016674005773…95368201573108142081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.534 × 10¹⁰⁰(101-digit number)
25346786033348011547…90736403146216284161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.069 × 10¹⁰⁰(101-digit number)
50693572066696023094…81472806292432568321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.013 × 10¹⁰¹(102-digit number)
10138714413339204618…62945612584865136641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.027 × 10¹⁰¹(102-digit number)
20277428826678409237…25891225169730273281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.055 × 10¹⁰¹(102-digit number)
40554857653356818475…51782450339460546561
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,772,435 XPM·at block #6,816,039 · 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