Block #383,291

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/31/2014, 8:02:02 AM · Difficulty 10.3994 · 6,425,807 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b115ad6e46a2a7dd0226e9239bfbf63bcd2b0490b384b4ed959ca29ca9dc97da

Height

#383,291

Difficulty

10.399441

Transactions

6

Size

1.29 KB

Version

2

Bits

0a6641cc

Nonce

87,080

Timestamp

1/31/2014, 8:02:02 AM

Confirmations

6,425,807

Merkle Root

3b2df6d74aa9eb65fab70b0081e1aed2c92f179e2ce17d228c3e5e6d10e1666b
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.

3.835 × 10⁹⁸(99-digit number)
38353733046386827431…13307607105665605481
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
3.835 × 10⁹⁸(99-digit number)
38353733046386827431…13307607105665605481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.670 × 10⁹⁸(99-digit number)
76707466092773654863…26615214211331210961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.534 × 10⁹⁹(100-digit number)
15341493218554730972…53230428422662421921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.068 × 10⁹⁹(100-digit number)
30682986437109461945…06460856845324843841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.136 × 10⁹⁹(100-digit number)
61365972874218923890…12921713690649687681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.227 × 10¹⁰⁰(101-digit number)
12273194574843784778…25843427381299375361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.454 × 10¹⁰⁰(101-digit number)
24546389149687569556…51686854762598750721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.909 × 10¹⁰⁰(101-digit number)
49092778299375139112…03373709525197501441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.818 × 10¹⁰⁰(101-digit number)
98185556598750278225…06747419050395002881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.963 × 10¹⁰¹(102-digit number)
19637111319750055645…13494838100790005761
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,716,838 XPM·at block #6,809,097 · 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