Block #2,647,672

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/4/2018, 1:37:06 AM · Difficulty 11.7614 · 4,189,094 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
82f477d9ce24abd7004bd768fb06bd885fff8c7d0ae8cb2873d2f2c2529c81fd

Height

#2,647,672

Difficulty

11.761357

Transactions

49

Size

15.26 KB

Version

2

Bits

0bc2e844

Nonce

495,043,899

Timestamp

5/4/2018, 1:37:06 AM

Confirmations

4,189,094

Merkle Root

3d4819c6584b94bb54608a5edca8be19ce36baf9da9e65bae9f05749a4fc6763
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.

8.226 × 10⁹⁴(95-digit number)
82269926098381634559…33535989491700187359
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
8.226 × 10⁹⁴(95-digit number)
82269926098381634559…33535989491700187359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.645 × 10⁹⁵(96-digit number)
16453985219676326911…67071978983400374719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.290 × 10⁹⁵(96-digit number)
32907970439352653823…34143957966800749439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.581 × 10⁹⁵(96-digit number)
65815940878705307647…68287915933601498879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.316 × 10⁹⁶(97-digit number)
13163188175741061529…36575831867202997759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.632 × 10⁹⁶(97-digit number)
26326376351482123059…73151663734405995519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.265 × 10⁹⁶(97-digit number)
52652752702964246118…46303327468811991039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.053 × 10⁹⁷(98-digit number)
10530550540592849223…92606654937623982079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.106 × 10⁹⁷(98-digit number)
21061101081185698447…85213309875247964159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.212 × 10⁹⁷(98-digit number)
42122202162371396894…70426619750495928319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.424 × 10⁹⁷(98-digit number)
84244404324742793788…40853239500991856639
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,938,411 XPM·at block #6,836,765 · 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