Block #2,644,006

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/2/2018, 7:45:40 AM · Difficulty 11.6997 · 4,187,537 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e17754e14b9b6ab9e3b9cd7452793eee8bd61d1c4e3b54a2c521fee5fe2289bd

Height

#2,644,006

Difficulty

11.699680

Transactions

11

Size

3.42 KB

Version

2

Bits

0bb31e41

Nonce

78,933,147

Timestamp

5/2/2018, 7:45:40 AM

Confirmations

4,187,537

Merkle Root

4d11e8879e74c03cefbd654d117341b7367db630038c3ca6bb587c18db991453
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.

3.417 × 10⁹³(94-digit number)
34172340325145401209…85947575879097366129
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
3.417 × 10⁹³(94-digit number)
34172340325145401209…85947575879097366129
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.834 × 10⁹³(94-digit number)
68344680650290802418…71895151758194732259
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.366 × 10⁹⁴(95-digit number)
13668936130058160483…43790303516389464519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.733 × 10⁹⁴(95-digit number)
27337872260116320967…87580607032778929039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.467 × 10⁹⁴(95-digit number)
54675744520232641935…75161214065557858079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.093 × 10⁹⁵(96-digit number)
10935148904046528387…50322428131115716159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.187 × 10⁹⁵(96-digit number)
21870297808093056774…00644856262231432319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.374 × 10⁹⁵(96-digit number)
43740595616186113548…01289712524462864639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.748 × 10⁹⁵(96-digit number)
87481191232372227096…02579425048925729279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.749 × 10⁹⁶(97-digit number)
17496238246474445419…05158850097851458559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.499 × 10⁹⁶(97-digit number)
34992476492948890838…10317700195702917119
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,434 XPM·at block #6,831,542 · 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