Block #521,551

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/2/2014, 1:01:51 PM · Difficulty 10.8627 · 6,286,377 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
672a134aa235a40142b6324cefdd5e9278dd86224f30458d4123407a2b2e80a8

Height

#521,551

Difficulty

10.862681

Transactions

5

Size

1.08 KB

Version

2

Bits

0adcd8a4

Nonce

12,936,794

Timestamp

5/2/2014, 1:01:51 PM

Confirmations

6,286,377

Merkle Root

6aa4a1ba2a56d90fa55e82ecb3f974ee679434df2dbcb79d25b14b228402e0b8
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.672 × 10⁹⁸(99-digit number)
16721560588942332471…02594650148138211589
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.672 × 10⁹⁸(99-digit number)
16721560588942332471…02594650148138211589
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.344 × 10⁹⁸(99-digit number)
33443121177884664942…05189300296276423179
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.688 × 10⁹⁸(99-digit number)
66886242355769329884…10378600592552846359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.337 × 10⁹⁹(100-digit number)
13377248471153865976…20757201185105692719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.675 × 10⁹⁹(100-digit number)
26754496942307731953…41514402370211385439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.350 × 10⁹⁹(100-digit number)
53508993884615463907…83028804740422770879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.070 × 10¹⁰⁰(101-digit number)
10701798776923092781…66057609480845541759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.140 × 10¹⁰⁰(101-digit number)
21403597553846185563…32115218961691083519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.280 × 10¹⁰⁰(101-digit number)
42807195107692371126…64230437923382167039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.561 × 10¹⁰⁰(101-digit number)
85614390215384742252…28460875846764334079
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,707,461 XPM·at block #6,807,927 · 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