Block #322,190

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/20/2013, 7:33:16 PM · Difficulty 10.1993 · 6,494,585 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
70ee268cfe749e279b4a1231f0f600b6880ff5fe2cad3d2ba0fd0694cedb2f7f

Height

#322,190

Difficulty

10.199344

Transactions

9

Size

19.54 KB

Version

2

Bits

0a33082d

Nonce

41,058

Timestamp

12/20/2013, 7:33:16 PM

Confirmations

6,494,585

Merkle Root

a4e27e75311a79546218e71439f9f671385787d7f6afec3641f55a090fd0c44b
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.992 × 10¹⁰⁰(101-digit number)
19924078319069478465…97631132703731085319
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.992 × 10¹⁰⁰(101-digit number)
19924078319069478465…97631132703731085319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.984 × 10¹⁰⁰(101-digit number)
39848156638138956930…95262265407462170639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.969 × 10¹⁰⁰(101-digit number)
79696313276277913861…90524530814924341279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.593 × 10¹⁰¹(102-digit number)
15939262655255582772…81049061629848682559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.187 × 10¹⁰¹(102-digit number)
31878525310511165544…62098123259697365119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.375 × 10¹⁰¹(102-digit number)
63757050621022331088…24196246519394730239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.275 × 10¹⁰²(103-digit number)
12751410124204466217…48392493038789460479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.550 × 10¹⁰²(103-digit number)
25502820248408932435…96784986077578920959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.100 × 10¹⁰²(103-digit number)
51005640496817864871…93569972155157841919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.020 × 10¹⁰³(104-digit number)
10201128099363572974…87139944310315683839
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,778,234 XPM·at block #6,816,774 · 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