Block #551,647

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/18/2014, 11:07:03 PM · Difficulty 10.9624 · 6,275,489 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b15f2d2d274feacebe787342399a154104e710bd7cb5088a1caf60863f06c1de

Height

#551,647

Difficulty

10.962409

Transactions

3

Size

659 B

Version

2

Bits

0af66076

Nonce

149,587,994

Timestamp

5/18/2014, 11:07:03 PM

Confirmations

6,275,489

Merkle Root

ad262123935b2131957c13c124368caffa631707b7e42b1f7e35071b1c1bee2e
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.061 × 10¹⁰⁰(101-digit number)
10614166680480871504…45586120331337215999
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.061 × 10¹⁰⁰(101-digit number)
10614166680480871504…45586120331337215999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.122 × 10¹⁰⁰(101-digit number)
21228333360961743008…91172240662674431999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.245 × 10¹⁰⁰(101-digit number)
42456666721923486016…82344481325348863999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.491 × 10¹⁰⁰(101-digit number)
84913333443846972032…64688962650697727999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.698 × 10¹⁰¹(102-digit number)
16982666688769394406…29377925301395455999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.396 × 10¹⁰¹(102-digit number)
33965333377538788813…58755850602790911999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.793 × 10¹⁰¹(102-digit number)
67930666755077577626…17511701205581823999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.358 × 10¹⁰²(103-digit number)
13586133351015515525…35023402411163647999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.717 × 10¹⁰²(103-digit number)
27172266702031031050…70046804822327295999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.434 × 10¹⁰²(103-digit number)
54344533404062062101…40093609644654591999
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,861,269 XPM·at block #6,827,135 · 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