Block #521,608

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/2/2014, 1:38:02 PM · Difficulty 10.8632 · 6,286,865 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
888c6466934d6dad35aa1f7762de24c289ff2743d990cce259e80eeab347f8a2

Height

#521,608

Difficulty

10.863247

Transactions

4

Size

889 B

Version

2

Bits

0adcfdba

Nonce

5,435,316

Timestamp

5/2/2014, 1:38:02 PM

Confirmations

6,286,865

Merkle Root

550f295c22cf6cefa370266e802581a564f124b2a49912f48cca680f1ce9518f
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.895 × 10⁹⁸(99-digit number)
18959555308357186063…13905160267900284459
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.895 × 10⁹⁸(99-digit number)
18959555308357186063…13905160267900284459
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.791 × 10⁹⁸(99-digit number)
37919110616714372127…27810320535800568919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.583 × 10⁹⁸(99-digit number)
75838221233428744254…55620641071601137839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.516 × 10⁹⁹(100-digit number)
15167644246685748850…11241282143202275679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.033 × 10⁹⁹(100-digit number)
30335288493371497701…22482564286404551359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.067 × 10⁹⁹(100-digit number)
60670576986742995403…44965128572809102719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.213 × 10¹⁰⁰(101-digit number)
12134115397348599080…89930257145618205439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.426 × 10¹⁰⁰(101-digit number)
24268230794697198161…79860514291236410879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.853 × 10¹⁰⁰(101-digit number)
48536461589394396323…59721028582472821759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.707 × 10¹⁰⁰(101-digit number)
97072923178788792646…19442057164945643519
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,711,840 XPM·at block #6,808,472 · 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