Block #2,090,121

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/27/2017, 12:41:01 PM · Difficulty 10.8751 · 4,751,181 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
62d72b214a4b461013a0a5ddb60476cce68a35f2b8beb8291323a4b3fa88ab83

Height

#2,090,121

Difficulty

10.875144

Transactions

2

Size

1.43 KB

Version

2

Bits

0ae00969

Nonce

208,635,551

Timestamp

4/27/2017, 12:41:01 PM

Confirmations

4,751,181

Merkle Root

3ce0448b07908ac228fa171eee86bba3c51ed129ba7b094bd3369388c32e3583
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.

1.267 × 10⁹⁷(98-digit number)
12679555811602359228…92649204025297863679
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.267 × 10⁹⁷(98-digit number)
12679555811602359228…92649204025297863679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.535 × 10⁹⁷(98-digit number)
25359111623204718457…85298408050595727359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.071 × 10⁹⁷(98-digit number)
50718223246409436915…70596816101191454719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.014 × 10⁹⁸(99-digit number)
10143644649281887383…41193632202382909439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.028 × 10⁹⁸(99-digit number)
20287289298563774766…82387264404765818879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.057 × 10⁹⁸(99-digit number)
40574578597127549532…64774528809531637759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.114 × 10⁹⁸(99-digit number)
81149157194255099065…29549057619063275519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.622 × 10⁹⁹(100-digit number)
16229831438851019813…59098115238126551039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.245 × 10⁹⁹(100-digit number)
32459662877702039626…18196230476253102079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.491 × 10⁹⁹(100-digit number)
64919325755404079252…36392460952506204159
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,974,775 XPM·at block #6,841,301 · 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