Block #2,817,988

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/31/2018, 5:55:34 AM · Difficulty 11.6963 · 4,020,428 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ca38fa3537966b0f61f881f4a37af481a2ac34f19162a79049b09594b1483bb8

Height

#2,817,988

Difficulty

11.696328

Transactions

5

Size

1.27 KB

Version

2

Bits

0bb24293

Nonce

381,612,311

Timestamp

8/31/2018, 5:55:34 AM

Confirmations

4,020,428

Merkle Root

fc04d293c2bcc6e50c8f83ddb3bac68286749ada358b111c15cc09883e2d3dca
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.100 × 10⁹⁶(97-digit number)
31001244726329941187…15968781725486681601
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.100 × 10⁹⁶(97-digit number)
31001244726329941187…15968781725486681601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.200 × 10⁹⁶(97-digit number)
62002489452659882375…31937563450973363201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.240 × 10⁹⁷(98-digit number)
12400497890531976475…63875126901946726401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.480 × 10⁹⁷(98-digit number)
24800995781063952950…27750253803893452801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.960 × 10⁹⁷(98-digit number)
49601991562127905900…55500507607786905601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.920 × 10⁹⁷(98-digit number)
99203983124255811801…11001015215573811201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.984 × 10⁹⁸(99-digit number)
19840796624851162360…22002030431147622401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.968 × 10⁹⁸(99-digit number)
39681593249702324720…44004060862295244801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.936 × 10⁹⁸(99-digit number)
79363186499404649440…88008121724590489601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.587 × 10⁹⁹(100-digit number)
15872637299880929888…76016243449180979201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.174 × 10⁹⁹(100-digit number)
31745274599761859776…52032486898361958401
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,951,601 XPM·at block #6,838,415 · 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