Block #2,628,295

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/24/2018, 8:19:43 PM · Difficulty 11.1983 · 4,217,083 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
85533af592e4ad65e12d790faff13fb961855dd63e1634595450fd288a7084ad

Height

#2,628,295

Difficulty

11.198301

Transactions

37

Size

11.92 KB

Version

2

Bits

0b32c3dd

Nonce

400,648,541

Timestamp

4/24/2018, 8:19:43 PM

Confirmations

4,217,083

Merkle Root

61d052128e1003308f463aad315667d3a95a1134b78d55d488a9b38a45a87d13
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.101 × 10⁹⁴(95-digit number)
31011182009378144248…00117845051252526561
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.101 × 10⁹⁴(95-digit number)
31011182009378144248…00117845051252526561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.202 × 10⁹⁴(95-digit number)
62022364018756288496…00235690102505053121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.240 × 10⁹⁵(96-digit number)
12404472803751257699…00471380205010106241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.480 × 10⁹⁵(96-digit number)
24808945607502515398…00942760410020212481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.961 × 10⁹⁵(96-digit number)
49617891215005030797…01885520820040424961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.923 × 10⁹⁵(96-digit number)
99235782430010061594…03771041640080849921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.984 × 10⁹⁶(97-digit number)
19847156486002012318…07542083280161699841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.969 × 10⁹⁶(97-digit number)
39694312972004024637…15084166560323399681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.938 × 10⁹⁶(97-digit number)
79388625944008049275…30168333120646799361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.587 × 10⁹⁷(98-digit number)
15877725188801609855…60336666241293598721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.175 × 10⁹⁷(98-digit number)
31755450377603219710…20673332482587197441
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:58,007,469 XPM·at block #6,845,377 · 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