Block #322,386

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/20/2013, 11:18:53 PM · Difficulty 10.1944 · 6,491,918 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
780130cc45d47c59330ab344a61a75cdb7a0fe50899d52b1a584f79b61814ef8

Height

#322,386

Difficulty

10.194376

Transactions

1

Size

1.01 KB

Version

2

Bits

0a31c299

Nonce

13,340

Timestamp

12/20/2013, 11:18:53 PM

Confirmations

6,491,918

Merkle Root

908afdf075d83e71902d77b9fe391cc1f7d6a183b76f4891185d0beae8f79845
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.158 × 10⁹⁶(97-digit number)
51581057215536127438…65294530150411356709
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.158 × 10⁹⁶(97-digit number)
51581057215536127438…65294530150411356709
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.031 × 10⁹⁷(98-digit number)
10316211443107225487…30589060300822713419
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.063 × 10⁹⁷(98-digit number)
20632422886214450975…61178120601645426839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.126 × 10⁹⁷(98-digit number)
41264845772428901950…22356241203290853679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.252 × 10⁹⁷(98-digit number)
82529691544857803900…44712482406581707359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.650 × 10⁹⁸(99-digit number)
16505938308971560780…89424964813163414719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.301 × 10⁹⁸(99-digit number)
33011876617943121560…78849929626326829439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.602 × 10⁹⁸(99-digit number)
66023753235886243120…57699859252653658879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.320 × 10⁹⁹(100-digit number)
13204750647177248624…15399718505307317759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.640 × 10⁹⁹(100-digit number)
26409501294354497248…30799437010614635519
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,758,493 XPM·at block #6,814,303 · 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