Block #328,806

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/25/2013, 1:13:23 PM · Difficulty 10.1674 · 6,479,641 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
89ecadace84492d1b12aaaff637e1e9c8e1f8c77fc1800e773af63651c8be3da

Height

#328,806

Difficulty

10.167417

Transactions

2

Size

1019 B

Version

2

Bits

0a2adbd4

Nonce

20,434

Timestamp

12/25/2013, 1:13:23 PM

Confirmations

6,479,641

Merkle Root

eb9c7b51ce90bc523398512a8039cb2753761291e742c06df2f09c62aa5b9970
Transactions (2)
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.692 × 10⁹⁸(99-digit number)
26921601551147383973…21873072847186285759
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.692 × 10⁹⁸(99-digit number)
26921601551147383973…21873072847186285759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.384 × 10⁹⁸(99-digit number)
53843203102294767947…43746145694372571519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.076 × 10⁹⁹(100-digit number)
10768640620458953589…87492291388745143039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.153 × 10⁹⁹(100-digit number)
21537281240917907179…74984582777490286079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.307 × 10⁹⁹(100-digit number)
43074562481835814358…49969165554980572159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.614 × 10⁹⁹(100-digit number)
86149124963671628716…99938331109961144319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.722 × 10¹⁰⁰(101-digit number)
17229824992734325743…99876662219922288639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.445 × 10¹⁰⁰(101-digit number)
34459649985468651486…99753324439844577279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.891 × 10¹⁰⁰(101-digit number)
68919299970937302973…99506648879689154559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.378 × 10¹⁰¹(102-digit number)
13783859994187460594…99013297759378309119
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,711,637 XPM·at block #6,808,446 · 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