Block #414,767

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/22/2014, 6:34:56 AM · Difficulty 10.3983 · 6,393,487 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
598c3e5119457718ce72af95f30f24f436ec8d62abb19cb5dea003979c7afb66

Height

#414,767

Difficulty

10.398263

Transactions

10

Size

2.63 KB

Version

2

Bits

0a65f48c

Nonce

112,199

Timestamp

2/22/2014, 6:34:56 AM

Confirmations

6,393,487

Merkle Root

c135bfa5e3e3fb69bd0d29b763b939e283ae67c4db9190cc98a57ddec4ee224f
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.

5.173 × 10⁹⁷(98-digit number)
51738182710301637725…44171388830035296641
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
5.173 × 10⁹⁷(98-digit number)
51738182710301637725…44171388830035296641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.034 × 10⁹⁸(99-digit number)
10347636542060327545…88342777660070593281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.069 × 10⁹⁸(99-digit number)
20695273084120655090…76685555320141186561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.139 × 10⁹⁸(99-digit number)
41390546168241310180…53371110640282373121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.278 × 10⁹⁸(99-digit number)
82781092336482620361…06742221280564746241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.655 × 10⁹⁹(100-digit number)
16556218467296524072…13484442561129492481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.311 × 10⁹⁹(100-digit number)
33112436934593048144…26968885122258984961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.622 × 10⁹⁹(100-digit number)
66224873869186096289…53937770244517969921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.324 × 10¹⁰⁰(101-digit number)
13244974773837219257…07875540489035939841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.648 × 10¹⁰⁰(101-digit number)
26489949547674438515…15751080978071879681
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,710,078 XPM·at block #6,808,253 · 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.

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