Block #393,427

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/7/2014, 4:15:49 AM · Difficulty 10.4356 · 6,413,445 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a10c1ff0e47fe2f69f0a8a5b1f82f22af433b0f4e2fb40af48d9088d74876a9b

Height

#393,427

Difficulty

10.435624

Transactions

1

Size

971 B

Version

2

Bits

0a6f850d

Nonce

90,741

Timestamp

2/7/2014, 4:15:49 AM

Confirmations

6,413,445

Merkle Root

f0095518d87da94e16a0907aeed0092d8386fb959f2fa393d28e69d83e74b618
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)
71632906649091248509…74168074659791906601
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)
71632906649091248509…74168074659791906601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.432 × 10⁹⁹(100-digit number)
14326581329818249701…48336149319583813201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.865 × 10⁹⁹(100-digit number)
28653162659636499403…96672298639167626401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.730 × 10⁹⁹(100-digit number)
57306325319272998807…93344597278335252801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.146 × 10¹⁰⁰(101-digit number)
11461265063854599761…86689194556670505601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.292 × 10¹⁰⁰(101-digit number)
22922530127709199523…73378389113341011201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.584 × 10¹⁰⁰(101-digit number)
45845060255418399046…46756778226682022401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.169 × 10¹⁰⁰(101-digit number)
91690120510836798092…93513556453364044801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.833 × 10¹⁰¹(102-digit number)
18338024102167359618…87027112906728089601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.667 × 10¹⁰¹(102-digit number)
36676048204334719236…74054225813456179201
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,699,083 XPM·at block #6,806,871 · 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