Block #2,912,643

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/6/2018, 4:36:36 PM · Difficulty 11.5098 · 3,926,683 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8b04358a704cec61dfc604e01224ab03d2bf809b7f4047f9ba622598f6ef2801

Height

#2,912,643

Difficulty

11.509770

Transactions

18

Size

4.24 KB

Version

2

Bits

0b82804b

Nonce

380,700,762

Timestamp

11/6/2018, 4:36:36 PM

Confirmations

3,926,683

Merkle Root

861805896a2ad44847f880ce5e308a5571558240a7f732e4ec714104ecec481b
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.

7.235 × 10⁹⁵(96-digit number)
72353477670170370960…16466766922607646721
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
7.235 × 10⁹⁵(96-digit number)
72353477670170370960…16466766922607646721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.447 × 10⁹⁶(97-digit number)
14470695534034074192…32933533845215293441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.894 × 10⁹⁶(97-digit number)
28941391068068148384…65867067690430586881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.788 × 10⁹⁶(97-digit number)
57882782136136296768…31734135380861173761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.157 × 10⁹⁷(98-digit number)
11576556427227259353…63468270761722347521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.315 × 10⁹⁷(98-digit number)
23153112854454518707…26936541523444695041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.630 × 10⁹⁷(98-digit number)
46306225708909037414…53873083046889390081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.261 × 10⁹⁷(98-digit number)
92612451417818074829…07746166093778780161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.852 × 10⁹⁸(99-digit number)
18522490283563614965…15492332187557560321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.704 × 10⁹⁸(99-digit number)
37044980567127229931…30984664375115120641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.408 × 10⁹⁸(99-digit number)
74089961134254459863…61969328750230241281
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,958,891 XPM·at block #6,839,325 · 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