Block #554,947

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/21/2014, 5:41:37 AM · Difficulty 10.9627 · 6,261,027 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a0be3772735a4ec47d3e80254a52d4012ef7c86879552f578c67fdc44792f5e4

Height

#554,947

Difficulty

10.962717

Transactions

10

Size

11.58 KB

Version

2

Bits

0af674a6

Nonce

1,296,615,593

Timestamp

5/21/2014, 5:41:37 AM

Confirmations

6,261,027

Merkle Root

6c5506593a3b0c1a7e9a3fda4ef1333cb9ae1b002b42970e582a1224b904eef2
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.

6.648 × 10⁹⁹(100-digit number)
66488158284247595798…56724326645055380481
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
6.648 × 10⁹⁹(100-digit number)
66488158284247595798…56724326645055380481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.329 × 10¹⁰⁰(101-digit number)
13297631656849519159…13448653290110760961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.659 × 10¹⁰⁰(101-digit number)
26595263313699038319…26897306580221521921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.319 × 10¹⁰⁰(101-digit number)
53190526627398076638…53794613160443043841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.063 × 10¹⁰¹(102-digit number)
10638105325479615327…07589226320886087681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.127 × 10¹⁰¹(102-digit number)
21276210650959230655…15178452641772175361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.255 × 10¹⁰¹(102-digit number)
42552421301918461310…30356905283544350721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.510 × 10¹⁰¹(102-digit number)
85104842603836922621…60713810567088701441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.702 × 10¹⁰²(103-digit number)
17020968520767384524…21427621134177402881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.404 × 10¹⁰²(103-digit number)
34041937041534769048…42855242268354805761
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,771,904 XPM·at block #6,815,973 · 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