Block #2,131,781

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/25/2017, 8:18:38 AM · Difficulty 10.9103 · 4,699,213 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b4be97bc0c1f68dbbaa4610e5d46cdad589725dd39c4e83dd06b5573daa91ba5

Height

#2,131,781

Difficulty

10.910291

Transactions

8

Size

4.92 KB

Version

2

Bits

0ae908cd

Nonce

129,655,328

Timestamp

5/25/2017, 8:18:38 AM

Confirmations

4,699,213

Merkle Root

fe04ce75a5875ababb882508d010612358174d8044a1565329b79bddc871d63c
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.337 × 10⁹⁵(96-digit number)
13377810349841468517…72186669651229388799
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.337 × 10⁹⁵(96-digit number)
13377810349841468517…72186669651229388799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.675 × 10⁹⁵(96-digit number)
26755620699682937034…44373339302458777599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.351 × 10⁹⁵(96-digit number)
53511241399365874068…88746678604917555199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.070 × 10⁹⁶(97-digit number)
10702248279873174813…77493357209835110399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.140 × 10⁹⁶(97-digit number)
21404496559746349627…54986714419670220799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.280 × 10⁹⁶(97-digit number)
42808993119492699254…09973428839340441599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.561 × 10⁹⁶(97-digit number)
85617986238985398509…19946857678680883199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.712 × 10⁹⁷(98-digit number)
17123597247797079701…39893715357361766399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.424 × 10⁹⁷(98-digit number)
34247194495594159403…79787430714723532799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.849 × 10⁹⁷(98-digit number)
68494388991188318807…59574861429447065599
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,892,093 XPM·at block #6,830,993 · 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