Block #2,136,378

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/29/2017, 2:40:50 AM · Difficulty 10.8945 · 4,680,937 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d5b0e867a325fa6ced21108da2016a13f6734adb501a76dc5ed434d34525b26c

Height

#2,136,378

Difficulty

10.894467

Transactions

2

Size

2.00 KB

Version

2

Bits

0ae4fbc4

Nonce

881,951,329

Timestamp

5/29/2017, 2:40:50 AM

Confirmations

4,680,937

Merkle Root

ea648684a8b99ca867bbd90d2e218437c374cfc408b1f18e56d0e3f06c2bcd46
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.649 × 10⁹³(94-digit number)
16495649662104458625…46353611444588456959
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.649 × 10⁹³(94-digit number)
16495649662104458625…46353611444588456959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.299 × 10⁹³(94-digit number)
32991299324208917251…92707222889176913919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.598 × 10⁹³(94-digit number)
65982598648417834502…85414445778353827839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.319 × 10⁹⁴(95-digit number)
13196519729683566900…70828891556707655679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.639 × 10⁹⁴(95-digit number)
26393039459367133800…41657783113415311359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.278 × 10⁹⁴(95-digit number)
52786078918734267601…83315566226830622719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.055 × 10⁹⁵(96-digit number)
10557215783746853520…66631132453661245439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.111 × 10⁹⁵(96-digit number)
21114431567493707040…33262264907322490879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.222 × 10⁹⁵(96-digit number)
42228863134987414081…66524529814644981759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.445 × 10⁹⁵(96-digit number)
84457726269974828162…33049059629289963519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.689 × 10⁹⁶(97-digit number)
16891545253994965632…66098119258579927039
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,782,565 XPM·at block #6,817,314 · 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