Block #381,433

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/29/2014, 11:56:45 PM · Difficulty 10.4066 · 6,436,408 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a8a81ce5060b5bc544b1d7ff1b00e6bc0a5a66d57764717295698e3021196cb8

Height

#381,433

Difficulty

10.406584

Transactions

2

Size

1.02 KB

Version

2

Bits

0a6815de

Nonce

193,594

Timestamp

1/29/2014, 11:56:45 PM

Confirmations

6,436,408

Merkle Root

07dea13fb6ab609e72b4b5794830d41f21cafc92ac07aacb5c303bbab7bfa354
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.894 × 10¹⁰⁰(101-digit number)
38942962807295513499…94653021507420280319
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.894 × 10¹⁰⁰(101-digit number)
38942962807295513499…94653021507420280319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.788 × 10¹⁰⁰(101-digit number)
77885925614591026998…89306043014840560639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.557 × 10¹⁰¹(102-digit number)
15577185122918205399…78612086029681121279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.115 × 10¹⁰¹(102-digit number)
31154370245836410799…57224172059362242559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.230 × 10¹⁰¹(102-digit number)
62308740491672821598…14448344118724485119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.246 × 10¹⁰²(103-digit number)
12461748098334564319…28896688237448970239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.492 × 10¹⁰²(103-digit number)
24923496196669128639…57793376474897940479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.984 × 10¹⁰²(103-digit number)
49846992393338257279…15586752949795880959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.969 × 10¹⁰²(103-digit number)
99693984786676514558…31173505899591761919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.993 × 10¹⁰³(104-digit number)
19938796957335302911…62347011799183523839
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,786,792 XPM·at block #6,817,840 · 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