Block #321,243

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/20/2013, 4:51:41 AM · Difficulty 10.1881 · 6,486,491 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
233e09175ec2bf45f51661f08350db1fdb027e8aba788e9cc0a46843f6a81f66

Height

#321,243

Difficulty

10.188119

Transactions

1

Size

1.11 KB

Version

2

Bits

0a30288b

Nonce

15,252

Timestamp

12/20/2013, 4:51:41 AM

Confirmations

6,486,491

Merkle Root

458718a82bd6def458306812d6e673b8a2ce4e6f68e7c14587e9298e76228371
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.

4.160 × 10¹⁰⁰(101-digit number)
41608498674968650529…96886226343187455999
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
4.160 × 10¹⁰⁰(101-digit number)
41608498674968650529…96886226343187455999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.321 × 10¹⁰⁰(101-digit number)
83216997349937301059…93772452686374911999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.664 × 10¹⁰¹(102-digit number)
16643399469987460211…87544905372749823999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.328 × 10¹⁰¹(102-digit number)
33286798939974920423…75089810745499647999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.657 × 10¹⁰¹(102-digit number)
66573597879949840847…50179621490999295999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.331 × 10¹⁰²(103-digit number)
13314719575989968169…00359242981998591999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.662 × 10¹⁰²(103-digit number)
26629439151979936338…00718485963997183999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.325 × 10¹⁰²(103-digit number)
53258878303959872677…01436971927994367999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.065 × 10¹⁰³(104-digit number)
10651775660791974535…02873943855988735999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.130 × 10¹⁰³(104-digit number)
21303551321583949071…05747887711977471999
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,705,907 XPM·at block #6,807,733 · 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