Block #350,380

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/9/2014, 12:21:11 AM · Difficulty 10.2879 · 6,460,594 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c033f872ae05bcc92c7a1dc70b34b90e30c29c8ecd866e1b619eba643dd36192

Height

#350,380

Difficulty

10.287925

Transactions

6

Size

1.56 KB

Version

2

Bits

0a49b574

Nonce

136,749

Timestamp

1/9/2014, 12:21:11 AM

Confirmations

6,460,594

Merkle Root

244e836de1966b94a5b35e6a999caf1a66d55c8d4a6cfd3963ed1c76d21ec75d
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.

7.942 × 10⁹⁹(100-digit number)
79428988283128096760…57693511733368966399
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
7.942 × 10⁹⁹(100-digit number)
79428988283128096760…57693511733368966399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.588 × 10¹⁰⁰(101-digit number)
15885797656625619352…15387023466737932799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.177 × 10¹⁰⁰(101-digit number)
31771595313251238704…30774046933475865599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.354 × 10¹⁰⁰(101-digit number)
63543190626502477408…61548093866951731199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.270 × 10¹⁰¹(102-digit number)
12708638125300495481…23096187733903462399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.541 × 10¹⁰¹(102-digit number)
25417276250600990963…46192375467806924799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.083 × 10¹⁰¹(102-digit number)
50834552501201981926…92384750935613849599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.016 × 10¹⁰²(103-digit number)
10166910500240396385…84769501871227699199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.033 × 10¹⁰²(103-digit number)
20333821000480792770…69539003742455398399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.066 × 10¹⁰²(103-digit number)
40667642000961585541…39078007484910796799
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,894 XPM·at block #6,810,973 · 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