Block #2,639,975

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/30/2018, 8:28:12 PM · Difficulty 11.5609 · 4,191,544 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
eb9633b1422a77a4f3841f1fd05303b4adcabe1636518ce64a9dcc91c2b54541

Height

#2,639,975

Difficulty

11.560891

Transactions

8

Size

15.73 KB

Version

2

Bits

0b8f9688

Nonce

26,888,519

Timestamp

4/30/2018, 8:28:12 PM

Confirmations

4,191,544

Merkle Root

37c02102b78488666c77ac096db995d0efd78818ad0827f81a08687418808a3f
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.948 × 10⁹⁴(95-digit number)
29488713656409399811…08642577307819252039
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.948 × 10⁹⁴(95-digit number)
29488713656409399811…08642577307819252039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.897 × 10⁹⁴(95-digit number)
58977427312818799622…17285154615638504079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.179 × 10⁹⁵(96-digit number)
11795485462563759924…34570309231277008159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.359 × 10⁹⁵(96-digit number)
23590970925127519848…69140618462554016319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.718 × 10⁹⁵(96-digit number)
47181941850255039697…38281236925108032639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.436 × 10⁹⁵(96-digit number)
94363883700510079395…76562473850216065279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.887 × 10⁹⁶(97-digit number)
18872776740102015879…53124947700432130559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.774 × 10⁹⁶(97-digit number)
37745553480204031758…06249895400864261119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.549 × 10⁹⁶(97-digit number)
75491106960408063516…12499790801728522239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.509 × 10⁹⁷(98-digit number)
15098221392081612703…24999581603457044479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.019 × 10⁹⁷(98-digit number)
30196442784163225406…49999163206914088959
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,896,242 XPM·at block #6,831,518 · 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