Block #2,753,213

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/17/2018, 4:52:03 PM · Difficulty 11.6534 · 4,085,978 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a1b5a1d29b2f77bddb1d87ec18c1c204855537ae4392f1ba838e522c0ebae5d9

Height

#2,753,213

Difficulty

11.653422

Transactions

27

Size

7.59 KB

Version

2

Bits

0ba746a8

Nonce

746,819,462

Timestamp

7/17/2018, 4:52:03 PM

Confirmations

4,085,978

Merkle Root

8c4a5f15f51a61f6f54d1041aff0a039857d99a85ef398cc1387c095e974a200
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.273 × 10⁹⁷(98-digit number)
12730117285262943036…97428689503506472961
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.273 × 10⁹⁷(98-digit number)
12730117285262943036…97428689503506472961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.546 × 10⁹⁷(98-digit number)
25460234570525886073…94857379007012945921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.092 × 10⁹⁷(98-digit number)
50920469141051772146…89714758014025891841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.018 × 10⁹⁸(99-digit number)
10184093828210354429…79429516028051783681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.036 × 10⁹⁸(99-digit number)
20368187656420708858…58859032056103567361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.073 × 10⁹⁸(99-digit number)
40736375312841417717…17718064112207134721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.147 × 10⁹⁸(99-digit number)
81472750625682835434…35436128224414269441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.629 × 10⁹⁹(100-digit number)
16294550125136567086…70872256448828538881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.258 × 10⁹⁹(100-digit number)
32589100250273134173…41744512897657077761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.517 × 10⁹⁹(100-digit number)
65178200500546268347…83489025795314155521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.303 × 10¹⁰⁰(101-digit number)
13035640100109253669…66978051590628311041
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,957,806 XPM·at block #6,839,190 · 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