Block #332,781

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/28/2013, 7:48:14 AM · Difficulty 10.1656 · 6,476,935 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d79b71afe9656b3ee6d590f829c82156af24bfb8cbe188c0b56fcb6498f480ed

Height

#332,781

Difficulty

10.165597

Transactions

6

Size

3.06 KB

Version

2

Bits

0a2a6491

Nonce

115,009

Timestamp

12/28/2013, 7:48:14 AM

Confirmations

6,476,935

Merkle Root

3a9644e719eb7d5b9e699958a3861d76256b83990615fe6e8dde805cdea951e6
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.

1.085 × 10⁹⁹(100-digit number)
10852845754593501183…06638245297628406079
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
1.085 × 10⁹⁹(100-digit number)
10852845754593501183…06638245297628406079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.170 × 10⁹⁹(100-digit number)
21705691509187002366…13276490595256812159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.341 × 10⁹⁹(100-digit number)
43411383018374004733…26552981190513624319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.682 × 10⁹⁹(100-digit number)
86822766036748009466…53105962381027248639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.736 × 10¹⁰⁰(101-digit number)
17364553207349601893…06211924762054497279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.472 × 10¹⁰⁰(101-digit number)
34729106414699203786…12423849524108994559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.945 × 10¹⁰⁰(101-digit number)
69458212829398407573…24847699048217989119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.389 × 10¹⁰¹(102-digit number)
13891642565879681514…49695398096435978239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.778 × 10¹⁰¹(102-digit number)
27783285131759363029…99390796192871956479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.556 × 10¹⁰¹(102-digit number)
55566570263518726058…98781592385743912959
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,721,808 XPM·at block #6,809,715 · 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