Block #2,841,436

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/16/2018, 5:37:07 AM · Difficulty 11.7218 · 3,992,564 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
35d37afce86353367365d987ab24f5d60cd9bc0855d8584b179915d277de961c

Height

#2,841,436

Difficulty

11.721832

Transactions

7

Size

2.73 KB

Version

2

Bits

0bb8c9fa

Nonce

63,982,708

Timestamp

9/16/2018, 5:37:07 AM

Confirmations

3,992,564

Merkle Root

cb38db514c3b42db4df4278d9ade10e29639a2adf1bd75c9e1ba6a7b8f591e7c
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.916 × 10⁹⁵(96-digit number)
29163336068839615527…65286542570965601601
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.916 × 10⁹⁵(96-digit number)
29163336068839615527…65286542570965601601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.832 × 10⁹⁵(96-digit number)
58326672137679231054…30573085141931203201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.166 × 10⁹⁶(97-digit number)
11665334427535846210…61146170283862406401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.333 × 10⁹⁶(97-digit number)
23330668855071692421…22292340567724812801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.666 × 10⁹⁶(97-digit number)
46661337710143384843…44584681135449625601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.332 × 10⁹⁶(97-digit number)
93322675420286769686…89169362270899251201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.866 × 10⁹⁷(98-digit number)
18664535084057353937…78338724541798502401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.732 × 10⁹⁷(98-digit number)
37329070168114707874…56677449083597004801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.465 × 10⁹⁷(98-digit number)
74658140336229415749…13354898167194009601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.493 × 10⁹⁸(99-digit number)
14931628067245883149…26709796334388019201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.986 × 10⁹⁸(99-digit number)
29863256134491766299…53419592668776038401
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,916,226 XPM·at block #6,833,999 · 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