Block #421,593

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/27/2014, 4:20:22 AM · Difficulty 10.3733 · 6,388,548 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3cdefc6b535f8a453baca37f23da2d0a20a48b56a456bfb4a8661bf2fba03e09

Height

#421,593

Difficulty

10.373324

Transactions

4

Size

1.61 KB

Version

2

Bits

0a5f922a

Nonce

113,392

Timestamp

2/27/2014, 4:20:22 AM

Confirmations

6,388,548

Merkle Root

7b36347ce2a567bcacd9840a3fcdcf5d747febeccba370540000a557241db478
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.638 × 10⁹⁵(96-digit number)
16386629476254944774…81717817155478630401
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.638 × 10⁹⁵(96-digit number)
16386629476254944774…81717817155478630401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.277 × 10⁹⁵(96-digit number)
32773258952509889549…63435634310957260801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.554 × 10⁹⁵(96-digit number)
65546517905019779099…26871268621914521601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.310 × 10⁹⁶(97-digit number)
13109303581003955819…53742537243829043201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.621 × 10⁹⁶(97-digit number)
26218607162007911639…07485074487658086401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.243 × 10⁹⁶(97-digit number)
52437214324015823279…14970148975316172801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.048 × 10⁹⁷(98-digit number)
10487442864803164655…29940297950632345601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.097 × 10⁹⁷(98-digit number)
20974885729606329311…59880595901264691201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.194 × 10⁹⁷(98-digit number)
41949771459212658623…19761191802529382401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.389 × 10⁹⁷(98-digit number)
83899542918425317247…39522383605058764801
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,725,196 XPM·at block #6,810,140 · 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