Block #2,620,346

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/19/2018, 3:09:47 AM · Difficulty 11.2414 · 4,216,673 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0a08bcdf99adafffa9817243ec773e3553f4d9435d24ad3772b0f772fbb90b93

Height

#2,620,346

Difficulty

11.241378

Transactions

6

Size

1.92 KB

Version

2

Bits

0b3dcaf3

Nonce

1,140,900,818

Timestamp

4/19/2018, 3:09:47 AM

Confirmations

4,216,673

Merkle Root

5cebc424ed124946258dd2d4f525826092eb7f2c9ebdbda6b203a443a197752c
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.

4.098 × 10⁹⁶(97-digit number)
40989488381480573477…46593348312448655359
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
4.098 × 10⁹⁶(97-digit number)
40989488381480573477…46593348312448655359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.197 × 10⁹⁶(97-digit number)
81978976762961146955…93186696624897310719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.639 × 10⁹⁷(98-digit number)
16395795352592229391…86373393249794621439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.279 × 10⁹⁷(98-digit number)
32791590705184458782…72746786499589242879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.558 × 10⁹⁷(98-digit number)
65583181410368917564…45493572999178485759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.311 × 10⁹⁸(99-digit number)
13116636282073783512…90987145998356971519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.623 × 10⁹⁸(99-digit number)
26233272564147567025…81974291996713943039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.246 × 10⁹⁸(99-digit number)
52466545128295134051…63948583993427886079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.049 × 10⁹⁹(100-digit number)
10493309025659026810…27897167986855772159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.098 × 10⁹⁹(100-digit number)
20986618051318053620…55794335973711544319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.197 × 10⁹⁹(100-digit number)
41973236102636107241…11588671947423088639
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,940,450 XPM·at block #6,837,018 · 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