Block #2,634,019

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/28/2018, 5:37:04 PM · Difficulty 11.2183 · 4,202,793 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fa007624aa6259f52bf54ff635f429af4d3b31bc437e5fc966c9adfcb74fde04

Height

#2,634,019

Difficulty

11.218257

Transactions

2

Size

608 B

Version

2

Bits

0b37dfb6

Nonce

2,073,466,310

Timestamp

4/28/2018, 5:37:04 PM

Confirmations

4,202,793

Merkle Root

be72fc294aae4a6a7ebf16202137f73ab21d06c29b889a0fa1cbdabd8ebb6d6a
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.

8.682 × 10⁹³(94-digit number)
86822039896631742435…76859687526528796281
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
8.682 × 10⁹³(94-digit number)
86822039896631742435…76859687526528796281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.736 × 10⁹⁴(95-digit number)
17364407979326348487…53719375053057592561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.472 × 10⁹⁴(95-digit number)
34728815958652696974…07438750106115185121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.945 × 10⁹⁴(95-digit number)
69457631917305393948…14877500212230370241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.389 × 10⁹⁵(96-digit number)
13891526383461078789…29755000424460740481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.778 × 10⁹⁵(96-digit number)
27783052766922157579…59510000848921480961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.556 × 10⁹⁵(96-digit number)
55566105533844315158…19020001697842961921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.111 × 10⁹⁶(97-digit number)
11113221106768863031…38040003395685923841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.222 × 10⁹⁶(97-digit number)
22226442213537726063…76080006791371847681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.445 × 10⁹⁶(97-digit number)
44452884427075452126…52160013582743695361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.890 × 10⁹⁶(97-digit number)
88905768854150904253…04320027165487390721
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,938,780 XPM·at block #6,836,811 · 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