Block #2,629,006

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/25/2018, 9:24:22 AM · Difficulty 11.1867 · 4,211,260 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
61555b7af9005d86397e6125bd0b4398c1dd9a6212c554f089d6a4503a8b3cb7

Height

#2,629,006

Difficulty

11.186723

Transactions

4

Size

1.19 KB

Version

2

Bits

0b2fcd15

Nonce

1,531,885,881

Timestamp

4/25/2018, 9:24:22 AM

Confirmations

4,211,260

Merkle Root

1ce78f1790c98f249df8f7cf96b4efbc7b48e2664d2251a1bea6f467d9bf80e5
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.552 × 10⁹⁷(98-digit number)
45526355800855852868…63154299992291512321
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.552 × 10⁹⁷(98-digit number)
45526355800855852868…63154299992291512321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.105 × 10⁹⁷(98-digit number)
91052711601711705737…26308599984583024641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.821 × 10⁹⁸(99-digit number)
18210542320342341147…52617199969166049281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.642 × 10⁹⁸(99-digit number)
36421084640684682295…05234399938332098561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.284 × 10⁹⁸(99-digit number)
72842169281369364590…10468799876664197121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.456 × 10⁹⁹(100-digit number)
14568433856273872918…20937599753328394241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.913 × 10⁹⁹(100-digit number)
29136867712547745836…41875199506656788481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.827 × 10⁹⁹(100-digit number)
58273735425095491672…83750399013313576961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.165 × 10¹⁰⁰(101-digit number)
11654747085019098334…67500798026627153921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.330 × 10¹⁰⁰(101-digit number)
23309494170038196668…35001596053254307841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.661 × 10¹⁰⁰(101-digit number)
46618988340076393337…70003192106508615681
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,966,442 XPM·at block #6,840,265 · 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