Block #317,319

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/17/2013, 2:37:07 PM · Difficulty 10.1560 · 6,497,655 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ccc7be2e7549b6914ee6bf2f7be0dfe34e6b695f20a866b15488d64407cd9bf8

Height

#317,319

Difficulty

10.155996

Transactions

6

Size

2.16 KB

Version

2

Bits

0a27ef5c

Nonce

88,477

Timestamp

12/17/2013, 2:37:07 PM

Confirmations

6,497,655

Merkle Root

1a1fc3f4d37485247fdc25d7db7a7e3d14d21462fd9840651179dbfb1c67e464
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.256 × 10¹⁰⁰(101-digit number)
12562444428311380545…96755336865360322099
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.256 × 10¹⁰⁰(101-digit number)
12562444428311380545…96755336865360322099
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.512 × 10¹⁰⁰(101-digit number)
25124888856622761091…93510673730720644199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.024 × 10¹⁰⁰(101-digit number)
50249777713245522183…87021347461441288399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.004 × 10¹⁰¹(102-digit number)
10049955542649104436…74042694922882576799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.009 × 10¹⁰¹(102-digit number)
20099911085298208873…48085389845765153599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.019 × 10¹⁰¹(102-digit number)
40199822170596417746…96170779691530307199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.039 × 10¹⁰¹(102-digit number)
80399644341192835493…92341559383060614399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.607 × 10¹⁰²(103-digit number)
16079928868238567098…84683118766121228799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.215 × 10¹⁰²(103-digit number)
32159857736477134197…69366237532242457599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.431 × 10¹⁰²(103-digit number)
64319715472954268394…38732475064484915199
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,878 XPM·at block #6,814,973 · 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