Block #365,238

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/18/2014, 2:51:59 PM · Difficulty 10.4241 · 6,448,606 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2df0b9d7093f74652fdbc00ac9964aebdfc1d4848e324d4ad2f3ec488330e1d7

Height

#365,238

Difficulty

10.424097

Transactions

2

Size

2.96 KB

Version

2

Bits

0a6c91a1

Nonce

1,476

Timestamp

1/18/2014, 2:51:59 PM

Confirmations

6,448,606

Merkle Root

7be0df2b9ce496b5040dda5115ea9167c50649df156bc1ebac68871b0d97558e
Transactions (2)
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.352 × 10¹⁰⁰(101-digit number)
13521718628438833224…94927951683975372801
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.352 × 10¹⁰⁰(101-digit number)
13521718628438833224…94927951683975372801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.704 × 10¹⁰⁰(101-digit number)
27043437256877666448…89855903367950745601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.408 × 10¹⁰⁰(101-digit number)
54086874513755332896…79711806735901491201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.081 × 10¹⁰¹(102-digit number)
10817374902751066579…59423613471802982401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.163 × 10¹⁰¹(102-digit number)
21634749805502133158…18847226943605964801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.326 × 10¹⁰¹(102-digit number)
43269499611004266316…37694453887211929601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.653 × 10¹⁰¹(102-digit number)
86538999222008532633…75388907774423859201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.730 × 10¹⁰²(103-digit number)
17307799844401706526…50777815548847718401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.461 × 10¹⁰²(103-digit number)
34615599688803413053…01555631097695436801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.923 × 10¹⁰²(103-digit number)
69231199377606826106…03111262195390873601
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,754,821 XPM·at block #6,813,843 · 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