Block #383,717

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/31/2014, 2:28:26 PM · Difficulty 10.4044 · 6,427,219 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
209d9714c8ffb72542569e4d4a8984cb474c984f9dc0e812195874308ff2e2f3

Height

#383,717

Difficulty

10.404358

Transactions

7

Size

2.59 KB

Version

2

Bits

0a6783fe

Nonce

869,247

Timestamp

1/31/2014, 2:28:26 PM

Confirmations

6,427,219

Merkle Root

3671dd245005f962152190b4afab5feb4b5ba8faf81620ae7a0b6ce04d139913
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.

6.243 × 10¹⁰³(104-digit number)
62430996694152353541…22569680685193502719
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
6.243 × 10¹⁰³(104-digit number)
62430996694152353541…22569680685193502719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.248 × 10¹⁰⁴(105-digit number)
12486199338830470708…45139361370387005439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.497 × 10¹⁰⁴(105-digit number)
24972398677660941416…90278722740774010879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.994 × 10¹⁰⁴(105-digit number)
49944797355321882833…80557445481548021759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.988 × 10¹⁰⁴(105-digit number)
99889594710643765666…61114890963096043519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.997 × 10¹⁰⁵(106-digit number)
19977918942128753133…22229781926192087039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.995 × 10¹⁰⁵(106-digit number)
39955837884257506266…44459563852384174079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.991 × 10¹⁰⁵(106-digit number)
79911675768515012533…88919127704768348159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.598 × 10¹⁰⁶(107-digit number)
15982335153703002506…77838255409536696319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.196 × 10¹⁰⁶(107-digit number)
31964670307406005013…55676510819073392639
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,731,592 XPM·at block #6,810,935 · 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