Block #380,695

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/29/2014, 10:59:04 AM · Difficulty 10.4115 · 6,428,927 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
608a1c8be31677f459f26898c73e89afa126888f4d23ad10965ef7c7dee00679

Height

#380,695

Difficulty

10.411496

Transactions

2

Size

1.13 KB

Version

2

Bits

0a6957d2

Nonce

13,809

Timestamp

1/29/2014, 10:59:04 AM

Confirmations

6,428,927

Merkle Root

143c4e4182d3d73139032e6c03e41d8c0ad56df2fffaf9b3e391dcb3ed8dd732
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.

5.372 × 10⁹⁷(98-digit number)
53725310632295699284…31782520401385907199
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
5.372 × 10⁹⁷(98-digit number)
53725310632295699284…31782520401385907199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.074 × 10⁹⁸(99-digit number)
10745062126459139856…63565040802771814399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.149 × 10⁹⁸(99-digit number)
21490124252918279713…27130081605543628799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.298 × 10⁹⁸(99-digit number)
42980248505836559427…54260163211087257599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.596 × 10⁹⁸(99-digit number)
85960497011673118855…08520326422174515199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.719 × 10⁹⁹(100-digit number)
17192099402334623771…17040652844349030399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.438 × 10⁹⁹(100-digit number)
34384198804669247542…34081305688698060799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.876 × 10⁹⁹(100-digit number)
68768397609338495084…68162611377396121599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.375 × 10¹⁰⁰(101-digit number)
13753679521867699016…36325222754792243199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.750 × 10¹⁰⁰(101-digit number)
27507359043735398033…72650445509584486399
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,721,054 XPM·at block #6,809,621 · 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