Block #393,637

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/7/2014, 7:48:33 AM · Difficulty 10.4355 · 6,422,760 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5c55611d32421b1c16f870cfebdd178551197fcc4805bf1dd9b4fb778f6e3204

Height

#393,637

Difficulty

10.435530

Transactions

6

Size

2.03 KB

Version

2

Bits

0a6f7eed

Nonce

16,718

Timestamp

2/7/2014, 7:48:33 AM

Confirmations

6,422,760

Merkle Root

58ea8f08351efa7952ee966182d55a751ff7765d5a2f205ed3f2f663fbfff76c
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.

9.105 × 10¹⁰³(104-digit number)
91059437360402903699…13736109427236026881
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
9.105 × 10¹⁰³(104-digit number)
91059437360402903699…13736109427236026881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.821 × 10¹⁰⁴(105-digit number)
18211887472080580739…27472218854472053761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.642 × 10¹⁰⁴(105-digit number)
36423774944161161479…54944437708944107521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.284 × 10¹⁰⁴(105-digit number)
72847549888322322959…09888875417888215041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.456 × 10¹⁰⁵(106-digit number)
14569509977664464591…19777750835776430081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.913 × 10¹⁰⁵(106-digit number)
29139019955328929183…39555501671552860161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.827 × 10¹⁰⁵(106-digit number)
58278039910657858367…79111003343105720321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.165 × 10¹⁰⁶(107-digit number)
11655607982131571673…58222006686211440641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.331 × 10¹⁰⁶(107-digit number)
23311215964263143346…16444013372422881281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.662 × 10¹⁰⁶(107-digit number)
46622431928526286693…32888026744845762561
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,775,299 XPM·at block #6,816,396 · 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