Block #315,472

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/16/2013, 1:00:10 PM · Difficulty 10.1014 · 6,497,154 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
47fd65663edb693c0cf811bd282f79c7b7f041b81d6bbd5ac20e93e37536651f

Height

#315,472

Difficulty

10.101407

Transactions

20

Size

5.77 KB

Version

2

Bits

0a19f5d1

Nonce

30,811

Timestamp

12/16/2013, 1:00:10 PM

Confirmations

6,497,154

Merkle Root

a25e083e7c9f528f7ac215a5f18d746674c99ee3441902307693df9cc7a56b65
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.862 × 10¹⁰⁰(101-digit number)
18628976366902844318…17971719098549043199
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.862 × 10¹⁰⁰(101-digit number)
18628976366902844318…17971719098549043199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.725 × 10¹⁰⁰(101-digit number)
37257952733805688636…35943438197098086399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.451 × 10¹⁰⁰(101-digit number)
74515905467611377273…71886876394196172799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.490 × 10¹⁰¹(102-digit number)
14903181093522275454…43773752788392345599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.980 × 10¹⁰¹(102-digit number)
29806362187044550909…87547505576784691199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.961 × 10¹⁰¹(102-digit number)
59612724374089101819…75095011153569382399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.192 × 10¹⁰²(103-digit number)
11922544874817820363…50190022307138764799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.384 × 10¹⁰²(103-digit number)
23845089749635640727…00380044614277529599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.769 × 10¹⁰²(103-digit number)
47690179499271281455…00760089228555059199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.538 × 10¹⁰²(103-digit number)
95380358998542562910…01520178457110118399
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,745,044 XPM·at block #6,812,625 · 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