Block #2,147,015

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/5/2017, 1:40:13 PM · Difficulty 10.8927 · 4,695,981 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e001eb93ec800142bcc9ef6cede79d09c4e0d9bfd37279152fcfa877eb503ec5

Height

#2,147,015

Difficulty

10.892671

Transactions

3

Size

1.51 KB

Version

2

Bits

0ae48616

Nonce

288,454,794

Timestamp

6/5/2017, 1:40:13 PM

Confirmations

4,695,981

Merkle Root

b1fe4c5e8438c0bc48edffbe0eb1d6dc6c1202b10a48426e2c73018bded8a6f9
Transactions (3)
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.

2.218 × 10⁹⁵(96-digit number)
22182820528845134163…76544741238559839999
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
2.218 × 10⁹⁵(96-digit number)
22182820528845134163…76544741238559839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.436 × 10⁹⁵(96-digit number)
44365641057690268326…53089482477119679999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.873 × 10⁹⁵(96-digit number)
88731282115380536652…06178964954239359999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.774 × 10⁹⁶(97-digit number)
17746256423076107330…12357929908478719999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.549 × 10⁹⁶(97-digit number)
35492512846152214660…24715859816957439999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.098 × 10⁹⁶(97-digit number)
70985025692304429321…49431719633914879999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.419 × 10⁹⁷(98-digit number)
14197005138460885864…98863439267829759999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.839 × 10⁹⁷(98-digit number)
28394010276921771728…97726878535659519999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.678 × 10⁹⁷(98-digit number)
56788020553843543457…95453757071319039999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.135 × 10⁹⁸(99-digit number)
11357604110768708691…90907514142638079999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.271 × 10⁹⁸(99-digit number)
22715208221537417383…81815028285276159999
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,988,323 XPM·at block #6,842,995 · 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