Block #1,114,162

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/17/2015, 10:39:46 PM · Difficulty 10.9112 · 5,712,974 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7fa21c394ff4156f29e21852ea49b54386e48837f885dc82abc1aecc9a6c06d5

Height

#1,114,162

Difficulty

10.911173

Transactions

2

Size

1.73 KB

Version

2

Bits

0ae942a8

Nonce

414,339,291

Timestamp

6/17/2015, 10:39:46 PM

Confirmations

5,712,974

Merkle Root

583a45bb0e6a2ab4a8ca3894c496ef5d7ecaa9139217fd3ca141417a5822c471
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.207 × 10⁹⁶(97-digit number)
12073305286759945921…49656570037864561519
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.207 × 10⁹⁶(97-digit number)
12073305286759945921…49656570037864561519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.414 × 10⁹⁶(97-digit number)
24146610573519891842…99313140075729123039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.829 × 10⁹⁶(97-digit number)
48293221147039783684…98626280151458246079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.658 × 10⁹⁶(97-digit number)
96586442294079567368…97252560302916492159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.931 × 10⁹⁷(98-digit number)
19317288458815913473…94505120605832984319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.863 × 10⁹⁷(98-digit number)
38634576917631826947…89010241211665968639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.726 × 10⁹⁷(98-digit number)
77269153835263653895…78020482423331937279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.545 × 10⁹⁸(99-digit number)
15453830767052730779…56040964846663874559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.090 × 10⁹⁸(99-digit number)
30907661534105461558…12081929693327749119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.181 × 10⁹⁸(99-digit number)
61815323068210923116…24163859386655498239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.236 × 10⁹⁹(100-digit number)
12363064613642184623…48327718773310996479
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,861,269 XPM·at block #6,827,135 · 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