Block #2,716,449

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/22/2018, 12:44:19 PM · Difficulty 11.6147 · 4,115,248 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9f53a6f198af4d585f7eb7b4c4ea09c07d419d52335986ad52120395bb6f72f8

Height

#2,716,449

Difficulty

11.614706

Transactions

4

Size

1.99 KB

Version

2

Bits

0b9d5d65

Nonce

631,791,214

Timestamp

6/22/2018, 12:44:19 PM

Confirmations

4,115,248

Merkle Root

fad1c43420aecd42a0e6ae1a82acbc79e402cddf65ecf19da86a811d79bc247d
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.802 × 10⁹⁴(95-digit number)
18022007361928799736…95588823034109840001
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.802 × 10⁹⁴(95-digit number)
18022007361928799736…95588823034109840001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.604 × 10⁹⁴(95-digit number)
36044014723857599472…91177646068219680001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.208 × 10⁹⁴(95-digit number)
72088029447715198944…82355292136439360001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.441 × 10⁹⁵(96-digit number)
14417605889543039788…64710584272878720001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.883 × 10⁹⁵(96-digit number)
28835211779086079577…29421168545757440001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.767 × 10⁹⁵(96-digit number)
57670423558172159155…58842337091514880001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.153 × 10⁹⁶(97-digit number)
11534084711634431831…17684674183029760001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.306 × 10⁹⁶(97-digit number)
23068169423268863662…35369348366059520001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.613 × 10⁹⁶(97-digit number)
46136338846537727324…70738696732119040001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.227 × 10⁹⁶(97-digit number)
92272677693075454649…41477393464238080001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.845 × 10⁹⁷(98-digit number)
18454535538615090929…82954786928476160001
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,897,685 XPM·at block #6,831,696 · 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