Block #330,583

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/26/2013, 6:50:08 PM · Difficulty 10.1677 · 6,495,732 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b1f8df47f3b79cb666d46c2a192b8dc8018ad2b7c1364b9cfb6b64b034844c43

Height

#330,583

Difficulty

10.167750

Transactions

8

Size

8.10 KB

Version

2

Bits

0a2af1a6

Nonce

21,268

Timestamp

12/26/2013, 6:50:08 PM

Confirmations

6,495,732

Merkle Root

a5476e1e9a28326cda6e96bcf14373cef28a76afa56ece5fec892361a9b13bf1
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.831 × 10⁹⁸(99-digit number)
58318232208728827817…35082404721281402879
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.831 × 10⁹⁸(99-digit number)
58318232208728827817…35082404721281402879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.166 × 10⁹⁹(100-digit number)
11663646441745765563…70164809442562805759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.332 × 10⁹⁹(100-digit number)
23327292883491531126…40329618885125611519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.665 × 10⁹⁹(100-digit number)
46654585766983062253…80659237770251223039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.330 × 10⁹⁹(100-digit number)
93309171533966124507…61318475540502446079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.866 × 10¹⁰⁰(101-digit number)
18661834306793224901…22636951081004892159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.732 × 10¹⁰⁰(101-digit number)
37323668613586449803…45273902162009784319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.464 × 10¹⁰⁰(101-digit number)
74647337227172899606…90547804324019568639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.492 × 10¹⁰¹(102-digit number)
14929467445434579921…81095608648039137279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.985 × 10¹⁰¹(102-digit number)
29858934890869159842…62191217296078274559
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,854,658 XPM·at block #6,826,314 · 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