Block #2,669,748

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/20/2018, 10:36:09 AM · Difficulty 11.6792 · 4,173,248 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e20173f1e6d4ea2bfb5ff0a2a57e5b5b7d567817967bcb660cbdde37c16c5e21

Height

#2,669,748

Difficulty

11.679210

Transactions

40

Size

12.67 KB

Version

2

Bits

0bade0b4

Nonce

193,578,207

Timestamp

5/20/2018, 10:36:09 AM

Confirmations

4,173,248

Merkle Root

aad13b7012a5f29438875dfdf1d1fa8e862d28485e804dd760f084c15e0f19c1
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.082 × 10⁹⁶(97-digit number)
20824282533081826537…03949403790367995681
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.082 × 10⁹⁶(97-digit number)
20824282533081826537…03949403790367995681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.164 × 10⁹⁶(97-digit number)
41648565066163653075…07898807580735991361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.329 × 10⁹⁶(97-digit number)
83297130132327306150…15797615161471982721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.665 × 10⁹⁷(98-digit number)
16659426026465461230…31595230322943965441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.331 × 10⁹⁷(98-digit number)
33318852052930922460…63190460645887930881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.663 × 10⁹⁷(98-digit number)
66637704105861844920…26380921291775861761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.332 × 10⁹⁸(99-digit number)
13327540821172368984…52761842583551723521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.665 × 10⁹⁸(99-digit number)
26655081642344737968…05523685167103447041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.331 × 10⁹⁸(99-digit number)
53310163284689475936…11047370334206894081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.066 × 10⁹⁹(100-digit number)
10662032656937895187…22094740668413788161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.132 × 10⁹⁹(100-digit number)
21324065313875790374…44189481336827576321
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,988,323 XPM·at block #6,842,995 · 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