Block #2,633,713

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/28/2018, 1:57:50 PM · Difficulty 11.2049 · 4,209,829 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6e2536f3f4ec7929bf40dda5b79dcb678a83404a9338b4288fed840368274254

Height

#2,633,713

Difficulty

11.204880

Transactions

3

Size

982 B

Version

2

Bits

0b347302

Nonce

993,435,219

Timestamp

4/28/2018, 1:57:50 PM

Confirmations

4,209,829

Merkle Root

42b73fbee3f649c00d932391207b56cf564791de906b920a14141a423c03c7cf
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.

2.542 × 10⁹⁴(95-digit number)
25422686543368612377…57025790354541642561
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
2.542 × 10⁹⁴(95-digit number)
25422686543368612377…57025790354541642561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.084 × 10⁹⁴(95-digit number)
50845373086737224754…14051580709083285121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.016 × 10⁹⁵(96-digit number)
10169074617347444950…28103161418166570241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.033 × 10⁹⁵(96-digit number)
20338149234694889901…56206322836333140481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.067 × 10⁹⁵(96-digit number)
40676298469389779803…12412645672666280961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.135 × 10⁹⁵(96-digit number)
81352596938779559607…24825291345332561921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.627 × 10⁹⁶(97-digit number)
16270519387755911921…49650582690665123841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.254 × 10⁹⁶(97-digit number)
32541038775511823842…99301165381330247681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.508 × 10⁹⁶(97-digit number)
65082077551023647685…98602330762660495361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.301 × 10⁹⁷(98-digit number)
13016415510204729537…97204661525320990721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.603 × 10⁹⁷(98-digit number)
26032831020409459074…94409323050641981441
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,992,711 XPM·at block #6,843,541 · 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