Block #383,100

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/31/2014, 5:03:32 AM · Difficulty 10.3978 · 6,443,644 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4668d1ddfb369177d6c7cd518e1279b58f6862184d948dc854ad4809f3b9b395

Height

#383,100

Difficulty

10.397806

Transactions

4

Size

885 B

Version

2

Bits

0a65d698

Nonce

111,510

Timestamp

1/31/2014, 5:03:32 AM

Confirmations

6,443,644

Merkle Root

92f1bacef181a859c4db2cdb6c751d47beaab4c5d1f3559cccadf2a83bca0c9a
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.953 × 10¹⁰⁵(106-digit number)
99534661825412874553…03868867879945574401
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.953 × 10¹⁰⁵(106-digit number)
99534661825412874553…03868867879945574401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.990 × 10¹⁰⁶(107-digit number)
19906932365082574910…07737735759891148801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.981 × 10¹⁰⁶(107-digit number)
39813864730165149821…15475471519782297601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.962 × 10¹⁰⁶(107-digit number)
79627729460330299642…30950943039564595201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.592 × 10¹⁰⁷(108-digit number)
15925545892066059928…61901886079129190401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.185 × 10¹⁰⁷(108-digit number)
31851091784132119857…23803772158258380801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.370 × 10¹⁰⁷(108-digit number)
63702183568264239714…47607544316516761601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.274 × 10¹⁰⁸(109-digit number)
12740436713652847942…95215088633033523201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.548 × 10¹⁰⁸(109-digit number)
25480873427305695885…90430177266067046401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.096 × 10¹⁰⁸(109-digit number)
50961746854611391771…80860354532134092801
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,858,108 XPM·at block #6,826,743 · 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