Block #342,933

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/4/2014, 9:27:06 AM · Difficulty 10.1648 · 6,463,450 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f7b6ee5deb07af896149f0de85a2ee4cb14ac2f38ba4ade033dc04e1f7541769

Height

#342,933

Difficulty

10.164804

Transactions

2

Size

1.30 KB

Version

2

Bits

0a2a3090

Nonce

286,403

Timestamp

1/4/2014, 9:27:06 AM

Confirmations

6,463,450

Merkle Root

0a1bad3d57edd25c6163c0014a53088e5aa96506dc9b75575c04924bf58a1023
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.419 × 10⁹⁹(100-digit number)
24191211518890048573…52975849484663346399
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.419 × 10⁹⁹(100-digit number)
24191211518890048573…52975849484663346399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.838 × 10⁹⁹(100-digit number)
48382423037780097146…05951698969326692799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.676 × 10⁹⁹(100-digit number)
96764846075560194293…11903397938653385599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.935 × 10¹⁰⁰(101-digit number)
19352969215112038858…23806795877306771199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.870 × 10¹⁰⁰(101-digit number)
38705938430224077717…47613591754613542399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.741 × 10¹⁰⁰(101-digit number)
77411876860448155434…95227183509227084799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.548 × 10¹⁰¹(102-digit number)
15482375372089631086…90454367018454169599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.096 × 10¹⁰¹(102-digit number)
30964750744179262173…80908734036908339199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.192 × 10¹⁰¹(102-digit number)
61929501488358524347…61817468073816678399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.238 × 10¹⁰²(103-digit number)
12385900297671704869…23634936147633356799
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,695,153 XPM·at block #6,806,382 · 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