Block #374,535

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/25/2014, 2:38:37 AM · Difficulty 10.4214 · 6,435,722 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ad3f5af70da9a206102f30c73ea62a3657f4c9d017efe873c48b34769fff913d

Height

#374,535

Difficulty

10.421418

Transactions

6

Size

2.31 KB

Version

2

Bits

0a6be20d

Nonce

17,409

Timestamp

1/25/2014, 2:38:37 AM

Confirmations

6,435,722

Merkle Root

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

2.099 × 10⁹⁹(100-digit number)
20996347812603695346…98746051156096307201
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
2.099 × 10⁹⁹(100-digit number)
20996347812603695346…98746051156096307201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.199 × 10⁹⁹(100-digit number)
41992695625207390692…97492102312192614401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.398 × 10⁹⁹(100-digit number)
83985391250414781384…94984204624385228801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.679 × 10¹⁰⁰(101-digit number)
16797078250082956276…89968409248770457601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.359 × 10¹⁰⁰(101-digit number)
33594156500165912553…79936818497540915201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.718 × 10¹⁰⁰(101-digit number)
67188313000331825107…59873636995081830401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.343 × 10¹⁰¹(102-digit number)
13437662600066365021…19747273990163660801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.687 × 10¹⁰¹(102-digit number)
26875325200132730042…39494547980327321601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.375 × 10¹⁰¹(102-digit number)
53750650400265460085…78989095960654643201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.075 × 10¹⁰²(103-digit number)
10750130080053092017…57978191921309286401
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,726,129 XPM·at block #6,810,256 · 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