Block #2,617,294

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/17/2018, 1:23:40 AM · Difficulty 11.2315 · 4,226,531 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7ee64b7855c8d646d072b14e4949667f291695c1c0dc96584e9562e919ab3200

Height

#2,617,294

Difficulty

11.231530

Transactions

3

Size

1.18 KB

Version

2

Bits

0b3b458c

Nonce

985,532,652

Timestamp

4/17/2018, 1:23:40 AM

Confirmations

4,226,531

Merkle Root

7cdcbc71ff769c9589a0d2ae27c27519793eae4542dbffc41fb9fbfeaf3ff768
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.910 × 10⁹⁶(97-digit number)
29102446779100351228…52579771230528204799
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.910 × 10⁹⁶(97-digit number)
29102446779100351228…52579771230528204799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.820 × 10⁹⁶(97-digit number)
58204893558200702456…05159542461056409599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.164 × 10⁹⁷(98-digit number)
11640978711640140491…10319084922112819199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.328 × 10⁹⁷(98-digit number)
23281957423280280982…20638169844225638399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.656 × 10⁹⁷(98-digit number)
46563914846560561965…41276339688451276799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.312 × 10⁹⁷(98-digit number)
93127829693121123930…82552679376902553599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.862 × 10⁹⁸(99-digit number)
18625565938624224786…65105358753805107199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.725 × 10⁹⁸(99-digit number)
37251131877248449572…30210717507610214399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.450 × 10⁹⁸(99-digit number)
74502263754496899144…60421435015220428799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.490 × 10⁹⁹(100-digit number)
14900452750899379828…20842870030440857599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.980 × 10⁹⁹(100-digit number)
29800905501798759657…41685740060881715199
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,994,975 XPM·at block #6,843,824 · 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