Block #380,308

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/29/2014, 4:18:10 AM · Difficulty 10.4126 · 6,427,980 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
50a8db31aca8bf2aff71502631a13c3bf6799cab755c472903a15d48316e73f8

Height

#380,308

Difficulty

10.412602

Transactions

5

Size

1.09 KB

Version

2

Bits

0a69a050

Nonce

27,801

Timestamp

1/29/2014, 4:18:10 AM

Confirmations

6,427,980

Merkle Root

79d38b9719fb01e6afa2f4c427b4173056f739fff651e8fb9205fcb37696d51e
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.

2.010 × 10¹¹⁰(111-digit number)
20108344779942577823…09226476538146324479
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
2.010 × 10¹¹⁰(111-digit number)
20108344779942577823…09226476538146324479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.021 × 10¹¹⁰(111-digit number)
40216689559885155647…18452953076292648959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.043 × 10¹¹⁰(111-digit number)
80433379119770311295…36905906152585297919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.608 × 10¹¹¹(112-digit number)
16086675823954062259…73811812305170595839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.217 × 10¹¹¹(112-digit number)
32173351647908124518…47623624610341191679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.434 × 10¹¹¹(112-digit number)
64346703295816249036…95247249220682383359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.286 × 10¹¹²(113-digit number)
12869340659163249807…90494498441364766719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.573 × 10¹¹²(113-digit number)
25738681318326499614…80988996882729533439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.147 × 10¹¹²(113-digit number)
51477362636652999228…61977993765459066879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.029 × 10¹¹³(114-digit number)
10295472527330599845…23955987530918133759
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,710,355 XPM·at block #6,808,287 · 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