Block #2,214,485

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/20/2017, 6:16:38 AM · Difficulty 10.9439 · 4,617,267 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9ace00c118b6e13747e1d48883a559562ae67c964da16075e6efd95045250e79

Height

#2,214,485

Difficulty

10.943858

Transactions

2

Size

721 B

Version

2

Bits

0af1a0aa

Nonce

560,721,278

Timestamp

7/20/2017, 6:16:38 AM

Confirmations

4,617,267

Merkle Root

7f7e25838e48456a4f1e450a3b3fe58c299befe4435f6e10ff89f2283f041eae
Transactions (2)
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.

3.768 × 10⁹²(93-digit number)
37689916760180197111…70284109759673338839
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
3.768 × 10⁹²(93-digit number)
37689916760180197111…70284109759673338839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.537 × 10⁹²(93-digit number)
75379833520360394223…40568219519346677679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.507 × 10⁹³(94-digit number)
15075966704072078844…81136439038693355359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.015 × 10⁹³(94-digit number)
30151933408144157689…62272878077386710719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.030 × 10⁹³(94-digit number)
60303866816288315379…24545756154773421439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.206 × 10⁹⁴(95-digit number)
12060773363257663075…49091512309546842879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.412 × 10⁹⁴(95-digit number)
24121546726515326151…98183024619093685759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.824 × 10⁹⁴(95-digit number)
48243093453030652303…96366049238187371519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.648 × 10⁹⁴(95-digit number)
96486186906061304606…92732098476374743039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.929 × 10⁹⁵(96-digit number)
19297237381212260921…85464196952749486079
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,898,124 XPM·at block #6,831,751 · 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