Block #2,703,206

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/13/2018, 4:49:33 AM · Difficulty 11.6288 · 4,133,948 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4af543f679d17fcb3ec09dabcdc4ef2b3f3ebb40f181ae108ce349941164a476

Height

#2,703,206

Difficulty

11.628780

Transactions

41

Size

11.75 KB

Version

2

Bits

0ba0f7c1

Nonce

68,504,561

Timestamp

6/13/2018, 4:49:33 AM

Confirmations

4,133,948

Merkle Root

1f9fa90f6da2536cabd9189e94af903ceec6be76c7b793b3bb5ff516f54c1e2c
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.

3.737 × 10⁹⁶(97-digit number)
37375969987595446292…07571579545115688961
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
3.737 × 10⁹⁶(97-digit number)
37375969987595446292…07571579545115688961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.475 × 10⁹⁶(97-digit number)
74751939975190892585…15143159090231377921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.495 × 10⁹⁷(98-digit number)
14950387995038178517…30286318180462755841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.990 × 10⁹⁷(98-digit number)
29900775990076357034…60572636360925511681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.980 × 10⁹⁷(98-digit number)
59801551980152714068…21145272721851023361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.196 × 10⁹⁸(99-digit number)
11960310396030542813…42290545443702046721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.392 × 10⁹⁸(99-digit number)
23920620792061085627…84581090887404093441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.784 × 10⁹⁸(99-digit number)
47841241584122171254…69162181774808186881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.568 × 10⁹⁸(99-digit number)
95682483168244342509…38324363549616373761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.913 × 10⁹⁹(100-digit number)
19136496633648868501…76648727099232747521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.827 × 10⁹⁹(100-digit number)
38272993267297737003…53297454198465495041
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,941,543 XPM·at block #6,837,153 · 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