Block #2,941,627

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/27/2018, 3:02:07 PM · Difficulty 11.3840 · 3,892,009 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a58bdecdde1e03bf0b435283b19cd1da571ebcb7e2bab8309055ba08faf51447

Height

#2,941,627

Difficulty

11.383960

Transactions

10

Size

3.42 KB

Version

2

Bits

0b624b2d

Nonce

732,228,047

Timestamp

11/27/2018, 3:02:07 PM

Confirmations

3,892,009

Merkle Root

965c3bc14fc32a3c77a21ed0e916371d029a0d9ef1b0e1d590cabd83ec254c3b
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.

1.179 × 10⁹⁴(95-digit number)
11792920412793721267…78951076690127781121
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
1.179 × 10⁹⁴(95-digit number)
11792920412793721267…78951076690127781121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.358 × 10⁹⁴(95-digit number)
23585840825587442534…57902153380255562241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.717 × 10⁹⁴(95-digit number)
47171681651174885068…15804306760511124481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.434 × 10⁹⁴(95-digit number)
94343363302349770136…31608613521022248961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.886 × 10⁹⁵(96-digit number)
18868672660469954027…63217227042044497921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.773 × 10⁹⁵(96-digit number)
37737345320939908054…26434454084088995841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.547 × 10⁹⁵(96-digit number)
75474690641879816109…52868908168177991681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.509 × 10⁹⁶(97-digit number)
15094938128375963221…05737816336355983361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.018 × 10⁹⁶(97-digit number)
30189876256751926443…11475632672711966721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.037 × 10⁹⁶(97-digit number)
60379752513503852887…22951265345423933441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.207 × 10⁹⁷(98-digit number)
12075950502700770577…45902530690847866881
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,913,300 XPM·at block #6,833,635 · 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