Block #313,520

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/15/2013, 12:34:04 PM · Difficulty 10.0101 · 6,501,429 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2722a67be58f9d67d21ffd00fd63d466cdf9f4d84da0955cdd37758cab248a60

Height

#313,520

Difficulty

10.010148

Transactions

4

Size

1.44 KB

Version

2

Bits

0a02990e

Nonce

88,037

Timestamp

12/15/2013, 12:34:04 PM

Confirmations

6,501,429

Merkle Root

a6c24da8b7fe501634d941f993cc3507511e3330550415421940bb84cb3756b6
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.875 × 10⁹²(93-digit number)
18754645188679598025…33330816193537902479
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.875 × 10⁹²(93-digit number)
18754645188679598025…33330816193537902479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.750 × 10⁹²(93-digit number)
37509290377359196050…66661632387075804959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.501 × 10⁹²(93-digit number)
75018580754718392100…33323264774151609919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.500 × 10⁹³(94-digit number)
15003716150943678420…66646529548303219839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.000 × 10⁹³(94-digit number)
30007432301887356840…33293059096606439679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.001 × 10⁹³(94-digit number)
60014864603774713680…66586118193212879359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.200 × 10⁹⁴(95-digit number)
12002972920754942736…33172236386425758719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.400 × 10⁹⁴(95-digit number)
24005945841509885472…66344472772851517439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.801 × 10⁹⁴(95-digit number)
48011891683019770944…32688945545703034879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.602 × 10⁹⁴(95-digit number)
96023783366039541888…65377891091406069759
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,763,689 XPM·at block #6,814,948 · 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