Block #398,357

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/10/2014, 4:19:58 PM · Difficulty 10.4243 · 6,445,171 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
838fe68fc71b65cc34b29e12035801f92546c9b8ddd34612934b4555168b11b6

Height

#398,357

Difficulty

10.424332

Transactions

1

Size

935 B

Version

2

Bits

0a6ca10a

Nonce

3,023

Timestamp

2/10/2014, 4:19:58 PM

Confirmations

6,445,171

Merkle Root

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

8.343 × 10⁹³(94-digit number)
83431958032597281927…57271150207724821601
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
8.343 × 10⁹³(94-digit number)
83431958032597281927…57271150207724821601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.668 × 10⁹⁴(95-digit number)
16686391606519456385…14542300415449643201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.337 × 10⁹⁴(95-digit number)
33372783213038912770…29084600830899286401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.674 × 10⁹⁴(95-digit number)
66745566426077825541…58169201661798572801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.334 × 10⁹⁵(96-digit number)
13349113285215565108…16338403323597145601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.669 × 10⁹⁵(96-digit number)
26698226570431130216…32676806647194291201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.339 × 10⁹⁵(96-digit number)
53396453140862260433…65353613294388582401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.067 × 10⁹⁶(97-digit number)
10679290628172452086…30707226588777164801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.135 × 10⁹⁶(97-digit number)
21358581256344904173…61414453177554329601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.271 × 10⁹⁶(97-digit number)
42717162512689808346…22828906355108659201
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,992,601 XPM·at block #6,843,527 · 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