Block #2,241,463

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/7/2017, 8:54:35 PM · Difficulty 10.9466 · 4,601,355 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9b26242d8a82d1ca9d368dba200a744e98039c0650a43770a665e4cc20efc53c

Height

#2,241,463

Difficulty

10.946649

Transactions

10

Size

5.87 KB

Version

2

Bits

0af25796

Nonce

705,280,764

Timestamp

8/7/2017, 8:54:35 PM

Confirmations

4,601,355

Merkle Root

088f8fb97f7c63156abd086410132f83565dfabe1394124635fb62111a352e3d
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.965 × 10⁹⁶(97-digit number)
79656016892681244393…83127527824317900801
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.965 × 10⁹⁶(97-digit number)
79656016892681244393…83127527824317900801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.593 × 10⁹⁷(98-digit number)
15931203378536248878…66255055648635801601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.186 × 10⁹⁷(98-digit number)
31862406757072497757…32510111297271603201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.372 × 10⁹⁷(98-digit number)
63724813514144995514…65020222594543206401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.274 × 10⁹⁸(99-digit number)
12744962702828999102…30040445189086412801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.548 × 10⁹⁸(99-digit number)
25489925405657998205…60080890378172825601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.097 × 10⁹⁸(99-digit number)
50979850811315996411…20161780756345651201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.019 × 10⁹⁹(100-digit number)
10195970162263199282…40323561512691302401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.039 × 10⁹⁹(100-digit number)
20391940324526398564…80647123025382604801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.078 × 10⁹⁹(100-digit number)
40783880649052797129…61294246050765209601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.156 × 10⁹⁹(100-digit number)
81567761298105594258…22588492101530419201
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,986,885 XPM·at block #6,842,817 · 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