Block #2,118,672

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/16/2017, 6:35:18 AM · Difficulty 10.9090 · 4,714,820 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
90fb0294c78dbb0fb5264dbe7dacb184c1a2a30c20a8fc405eb344342933ac11

Height

#2,118,672

Difficulty

10.909037

Transactions

2

Size

2.73 KB

Version

2

Bits

0ae8b6a3

Nonce

138,041,275

Timestamp

5/16/2017, 6:35:18 AM

Confirmations

4,714,820

Merkle Root

f93097b26792962f82f42593f7f6d041c34c596ac9b0e2c2d87fdf7dfbc14b05
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.

9.445 × 10⁹⁶(97-digit number)
94458164045498688359…26344449971248665599
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
9.445 × 10⁹⁶(97-digit number)
94458164045498688359…26344449971248665599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.889 × 10⁹⁷(98-digit number)
18891632809099737671…52688899942497331199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.778 × 10⁹⁷(98-digit number)
37783265618199475343…05377799884994662399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.556 × 10⁹⁷(98-digit number)
75566531236398950687…10755599769989324799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.511 × 10⁹⁸(99-digit number)
15113306247279790137…21511199539978649599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.022 × 10⁹⁸(99-digit number)
30226612494559580275…43022399079957299199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.045 × 10⁹⁸(99-digit number)
60453224989119160550…86044798159914598399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.209 × 10⁹⁹(100-digit number)
12090644997823832110…72089596319829196799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.418 × 10⁹⁹(100-digit number)
24181289995647664220…44179192639658393599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.836 × 10⁹⁹(100-digit number)
48362579991295328440…88358385279316787199
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,912,142 XPM·at block #6,833,491 · 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