Block #328,772

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/25/2013, 12:40:00 PM · Difficulty 10.1674 · 6,478,367 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
200ce613a92f7241ae74aad98a0b3974a37985382f59718ce80b007bd8f44bf0

Height

#328,772

Difficulty

10.167393

Transactions

9

Size

2.54 KB

Version

2

Bits

0a2ada48

Nonce

251,016

Timestamp

12/25/2013, 12:40:00 PM

Confirmations

6,478,367

Merkle Root

ac5130628a8ab1f4b37ce510821338cf9ff6ddd2428ba5ef42d9e6eaac5db6c9
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.455 × 10⁹⁹(100-digit number)
74559796772635408057…25403140533898065919
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.455 × 10⁹⁹(100-digit number)
74559796772635408057…25403140533898065919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.491 × 10¹⁰⁰(101-digit number)
14911959354527081611…50806281067796131839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.982 × 10¹⁰⁰(101-digit number)
29823918709054163222…01612562135592263679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.964 × 10¹⁰⁰(101-digit number)
59647837418108326445…03225124271184527359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.192 × 10¹⁰¹(102-digit number)
11929567483621665289…06450248542369054719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.385 × 10¹⁰¹(102-digit number)
23859134967243330578…12900497084738109439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.771 × 10¹⁰¹(102-digit number)
47718269934486661156…25800994169476218879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.543 × 10¹⁰¹(102-digit number)
95436539868973322313…51601988338952437759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.908 × 10¹⁰²(103-digit number)
19087307973794664462…03203976677904875519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.817 × 10¹⁰²(103-digit number)
38174615947589328925…06407953355809751039
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,701,119 XPM·at block #6,807,138 · 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