Block #387,888

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/3/2014, 10:42:19 AM · Difficulty 10.4152 · 6,423,206 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
af75779247641637accc7afca1a2c1906db939226d69f592d73a2cf481f296cc

Height

#387,888

Difficulty

10.415239

Transactions

3

Size

14.66 KB

Version

2

Bits

0a6a4d17

Nonce

95,870

Timestamp

2/3/2014, 10:42:19 AM

Confirmations

6,423,206

Merkle Root

b3276272730bcd2971a7f6c3943e515b24f939282272ebea74ac1625644a60da
Transactions (3)
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.163 × 10⁹⁸(99-digit number)
71636017670786230214…79501318075145341251
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.163 × 10⁹⁸(99-digit number)
71636017670786230214…79501318075145341251
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.432 × 10⁹⁹(100-digit number)
14327203534157246042…59002636150290682501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.865 × 10⁹⁹(100-digit number)
28654407068314492085…18005272300581365001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.730 × 10⁹⁹(100-digit number)
57308814136628984171…36010544601162730001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.146 × 10¹⁰⁰(101-digit number)
11461762827325796834…72021089202325460001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.292 × 10¹⁰⁰(101-digit number)
22923525654651593668…44042178404650920001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.584 × 10¹⁰⁰(101-digit number)
45847051309303187337…88084356809301840001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.169 × 10¹⁰⁰(101-digit number)
91694102618606374675…76168713618603680001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.833 × 10¹⁰¹(102-digit number)
18338820523721274935…52337427237207360001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.667 × 10¹⁰¹(102-digit number)
36677641047442549870…04674854474414720001
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,732,860 XPM·at block #6,811,093 · 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