Block #322,937

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/21/2013, 8:24:21 AM · Difficulty 10.1956 · 6,483,373 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
29382ba277ca45206f91831ec60515bce9bae90ae8f3edb8ad1a6fb24ce0858e

Height

#322,937

Difficulty

10.195566

Transactions

5

Size

1.66 KB

Version

2

Bits

0a321096

Nonce

150,462

Timestamp

12/21/2013, 8:24:21 AM

Confirmations

6,483,373

Merkle Root

0e0d2d26f9cf5ce1c032ae095366b64e7442eabf794b249af8505cf683cbf23a
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.

6.631 × 10⁹⁸(99-digit number)
66311217952698378212…09500608611661520859
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
6.631 × 10⁹⁸(99-digit number)
66311217952698378212…09500608611661520859
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.326 × 10⁹⁹(100-digit number)
13262243590539675642…19001217223323041719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.652 × 10⁹⁹(100-digit number)
26524487181079351284…38002434446646083439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.304 × 10⁹⁹(100-digit number)
53048974362158702569…76004868893292166879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.060 × 10¹⁰⁰(101-digit number)
10609794872431740513…52009737786584333759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.121 × 10¹⁰⁰(101-digit number)
21219589744863481027…04019475573168667519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.243 × 10¹⁰⁰(101-digit number)
42439179489726962055…08038951146337335039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.487 × 10¹⁰⁰(101-digit number)
84878358979453924111…16077902292674670079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.697 × 10¹⁰¹(102-digit number)
16975671795890784822…32155804585349340159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.395 × 10¹⁰¹(102-digit number)
33951343591781569644…64311609170698680319
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,694,568 XPM·at block #6,806,309 · 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