Block #2,988,601

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/30/2018, 8:31:20 PM · Difficulty 11.2690 · 3,844,613 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ef98deae4bc15de322910221c732464432480cd0efc1601ee9b7ca570824294b

Height

#2,988,601

Difficulty

11.269041

Transactions

2

Size

1.05 KB

Version

2

Bits

0b44dfd9

Nonce

229,823,326

Timestamp

12/30/2018, 8:31:20 PM

Confirmations

3,844,613

Merkle Root

caa213ae1bec25b4819e9edffa29b047c338712316b38b3fe3c3f2ebf576a469
Transactions (2)
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.

9.789 × 10⁹³(94-digit number)
97894827953740950243…41520263125192622081
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
9.789 × 10⁹³(94-digit number)
97894827953740950243…41520263125192622081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.957 × 10⁹⁴(95-digit number)
19578965590748190048…83040526250385244161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.915 × 10⁹⁴(95-digit number)
39157931181496380097…66081052500770488321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.831 × 10⁹⁴(95-digit number)
78315862362992760195…32162105001540976641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.566 × 10⁹⁵(96-digit number)
15663172472598552039…64324210003081953281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.132 × 10⁹⁵(96-digit number)
31326344945197104078…28648420006163906561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.265 × 10⁹⁵(96-digit number)
62652689890394208156…57296840012327813121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.253 × 10⁹⁶(97-digit number)
12530537978078841631…14593680024655626241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.506 × 10⁹⁶(97-digit number)
25061075956157683262…29187360049311252481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.012 × 10⁹⁶(97-digit number)
50122151912315366524…58374720098622504961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.002 × 10⁹⁷(98-digit number)
10024430382463073304…16749440197245009921
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,909,898 XPM·at block #6,833,213 · 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