Block #3,418,299

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/3/2019, 7:44:15 PM · Difficulty 10.9829 · 3,407,360 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ff87e83cf51d39f9eb4903fb37f3f61ec4ff72333c5354f10ac9ffb40e80e69c

Height

#3,418,299

Difficulty

10.982891

Transactions

20

Size

6.55 KB

Version

2

Bits

0afb9eb7

Nonce

499,713,900

Timestamp

11/3/2019, 7:44:15 PM

Confirmations

3,407,360

Merkle Root

33d40e35af330d1c645c37d91c9eeb91804ccb668d0a01ef939f55fb9bcdec4f
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.432 × 10⁹⁴(95-digit number)
14323485098671546133…64965272645249998081
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.432 × 10⁹⁴(95-digit number)
14323485098671546133…64965272645249998081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.864 × 10⁹⁴(95-digit number)
28646970197343092267…29930545290499996161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.729 × 10⁹⁴(95-digit number)
57293940394686184534…59861090580999992321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.145 × 10⁹⁵(96-digit number)
11458788078937236906…19722181161999984641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.291 × 10⁹⁵(96-digit number)
22917576157874473813…39444362323999969281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.583 × 10⁹⁵(96-digit number)
45835152315748947627…78888724647999938561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.167 × 10⁹⁵(96-digit number)
91670304631497895254…57777449295999877121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.833 × 10⁹⁶(97-digit number)
18334060926299579050…15554898591999754241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.666 × 10⁹⁶(97-digit number)
36668121852599158101…31109797183999508481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.333 × 10⁹⁶(97-digit number)
73336243705198316203…62219594367999016961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.466 × 10⁹⁷(98-digit number)
14667248741039663240…24439188735998033921
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,849,379 XPM·at block #6,825,658 · 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