Block #2,843,668

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/17/2018, 5:13:51 PM · Difficulty 11.7270 · 3,998,191 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
62672d05d4f9ab26640acd21c25c02eb1a367feddb5c55740142ab91bff2c5fe

Height

#2,843,668

Difficulty

11.726979

Transactions

5

Size

1.48 KB

Version

2

Bits

0bba1b50

Nonce

843,791,809

Timestamp

9/17/2018, 5:13:51 PM

Confirmations

3,998,191

Merkle Root

30fe93805d7564451a7449dd2438d87c1835ef76d729fd2f059ae29093340f76
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.

6.440 × 10⁹⁴(95-digit number)
64407554007141265135…07573814446989160001
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
6.440 × 10⁹⁴(95-digit number)
64407554007141265135…07573814446989160001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.288 × 10⁹⁵(96-digit number)
12881510801428253027…15147628893978320001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.576 × 10⁹⁵(96-digit number)
25763021602856506054…30295257787956640001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.152 × 10⁹⁵(96-digit number)
51526043205713012108…60590515575913280001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.030 × 10⁹⁶(97-digit number)
10305208641142602421…21181031151826560001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.061 × 10⁹⁶(97-digit number)
20610417282285204843…42362062303653120001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.122 × 10⁹⁶(97-digit number)
41220834564570409686…84724124607306240001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.244 × 10⁹⁶(97-digit number)
82441669129140819373…69448249214612480001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.648 × 10⁹⁷(98-digit number)
16488333825828163874…38896498429224960001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.297 × 10⁹⁷(98-digit number)
32976667651656327749…77792996858449920001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.595 × 10⁹⁷(98-digit number)
65953335303312655499…55585993716899840001
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,979,249 XPM·at block #6,841,858 · 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