Block #2,181,669

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/27/2017, 8:29:10 PM · Difficulty 10.9362 · 4,661,378 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
082459aba3809f1c3622977f350ed5ea675f7638095432b3aaf1a14f9862a31e

Height

#2,181,669

Difficulty

10.936194

Transactions

23

Size

10.13 KB

Version

2

Bits

0aefaa62

Nonce

263,847,241

Timestamp

6/27/2017, 8:29:10 PM

Confirmations

4,661,378

Merkle Root

a582bd4751540b4a1000134ae3be6be1c2dae35a60eb0b245288d32d5cf174f6
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.948 × 10⁹⁴(95-digit number)
19486402332003408762…28245288267991953799
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.948 × 10⁹⁴(95-digit number)
19486402332003408762…28245288267991953799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.897 × 10⁹⁴(95-digit number)
38972804664006817524…56490576535983907599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.794 × 10⁹⁴(95-digit number)
77945609328013635049…12981153071967815199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.558 × 10⁹⁵(96-digit number)
15589121865602727009…25962306143935630399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.117 × 10⁹⁵(96-digit number)
31178243731205454019…51924612287871260799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.235 × 10⁹⁵(96-digit number)
62356487462410908039…03849224575742521599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.247 × 10⁹⁶(97-digit number)
12471297492482181607…07698449151485043199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.494 × 10⁹⁶(97-digit number)
24942594984964363215…15396898302970086399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.988 × 10⁹⁶(97-digit number)
49885189969928726431…30793796605940172799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.977 × 10⁹⁶(97-digit number)
99770379939857452863…61587593211880345599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.995 × 10⁹⁷(98-digit number)
19954075987971490572…23175186423760691199
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,733 XPM·at block #6,843,046 · 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