Block #2,884,145

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/16/2018, 10:18:46 PM · Difficulty 11.6278 · 3,959,947 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
771dd910cb81916202e022536dfffe188917f0974e933a36f8d95e7704404724

Height

#2,884,145

Difficulty

11.627758

Transactions

6

Size

5.46 KB

Version

2

Bits

0ba0b4b9

Nonce

2,120,081,174

Timestamp

10/16/2018, 10:18:46 PM

Confirmations

3,959,947

Merkle Root

623af2b9bfd5e5ed8749b6f1a14889ea6354d7ec7295fbfda7b45404552d17ea
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.953 × 10⁹⁷(98-digit number)
19535713056576885378…79379632257580236801
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.953 × 10⁹⁷(98-digit number)
19535713056576885378…79379632257580236801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.907 × 10⁹⁷(98-digit number)
39071426113153770757…58759264515160473601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.814 × 10⁹⁷(98-digit number)
78142852226307541514…17518529030320947201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.562 × 10⁹⁸(99-digit number)
15628570445261508302…35037058060641894401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.125 × 10⁹⁸(99-digit number)
31257140890523016605…70074116121283788801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.251 × 10⁹⁸(99-digit number)
62514281781046033211…40148232242567577601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.250 × 10⁹⁹(100-digit number)
12502856356209206642…80296464485135155201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.500 × 10⁹⁹(100-digit number)
25005712712418413284…60592928970270310401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.001 × 10⁹⁹(100-digit number)
50011425424836826569…21185857940540620801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.000 × 10¹⁰⁰(101-digit number)
10002285084967365313…42371715881081241601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.000 × 10¹⁰⁰(101-digit number)
20004570169934730627…84743431762162483201
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,997,109 XPM·at block #6,844,091 · 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