Block #330,419

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/26/2013, 3:59:16 PM · Difficulty 10.1689 · 6,496,690 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4b0f0ed4b3475cc61ce530d0ad620f21e46202393d8d88fb704c0a5a82c225f6

Height

#330,419

Difficulty

10.168920

Transactions

1

Size

971 B

Version

2

Bits

0a2b3e57

Nonce

194,886

Timestamp

12/26/2013, 3:59:16 PM

Confirmations

6,496,690

Merkle Root

135a13b531d148332087c3548fbb0ab06e298d45a33a15ca9ed01657fc971082
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.025 × 10⁹⁹(100-digit number)
30259347435561216242…52490159606824755199
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.025 × 10⁹⁹(100-digit number)
30259347435561216242…52490159606824755199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.051 × 10⁹⁹(100-digit number)
60518694871122432484…04980319213649510399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.210 × 10¹⁰⁰(101-digit number)
12103738974224486496…09960638427299020799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.420 × 10¹⁰⁰(101-digit number)
24207477948448972993…19921276854598041599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.841 × 10¹⁰⁰(101-digit number)
48414955896897945987…39842553709196083199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.682 × 10¹⁰⁰(101-digit number)
96829911793795891975…79685107418392166399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.936 × 10¹⁰¹(102-digit number)
19365982358759178395…59370214836784332799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.873 × 10¹⁰¹(102-digit number)
38731964717518356790…18740429673568665599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.746 × 10¹⁰¹(102-digit number)
77463929435036713580…37480859347137331199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.549 × 10¹⁰²(103-digit number)
15492785887007342716…74961718694274662399
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,861,051 XPM·at block #6,827,108 · 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