Block #2,184,344

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/29/2017, 7:54:37 AM · Difficulty 10.9429 · 4,647,409 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3433ec55a798791506a8b9202fc7cb83ab084dfc79bb04eb052ae14c08365bc0

Height

#2,184,344

Difficulty

10.942855

Transactions

2

Size

427 B

Version

2

Bits

0af15eec

Nonce

616,026,969

Timestamp

6/29/2017, 7:54:37 AM

Confirmations

4,647,409

Merkle Root

c90aea2bc4d1b74ccfeab52b1cd8d91554a162ff927ec6130c9bc08e0d460235
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.554 × 10⁹⁵(96-digit number)
15541033713809707069…03348965636658563359
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.554 × 10⁹⁵(96-digit number)
15541033713809707069…03348965636658563359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.108 × 10⁹⁵(96-digit number)
31082067427619414138…06697931273317126719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.216 × 10⁹⁵(96-digit number)
62164134855238828276…13395862546634253439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.243 × 10⁹⁶(97-digit number)
12432826971047765655…26791725093268506879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.486 × 10⁹⁶(97-digit number)
24865653942095531310…53583450186537013759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.973 × 10⁹⁶(97-digit number)
49731307884191062621…07166900373074027519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.946 × 10⁹⁶(97-digit number)
99462615768382125243…14333800746148055039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.989 × 10⁹⁷(98-digit number)
19892523153676425048…28667601492296110079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.978 × 10⁹⁷(98-digit number)
39785046307352850097…57335202984592220159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.957 × 10⁹⁷(98-digit number)
79570092614705700194…14670405969184440319
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,132 XPM·at block #6,831,752 · 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