Block #315,679

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/16/2013, 3:25:28 PM · Difficulty 10.1124 · 6,498,533 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
dd22a366897d399323159ef52f524fd116b10812e5984dd48c49b784edb3c251

Height

#315,679

Difficulty

10.112444

Transactions

2

Size

576 B

Version

2

Bits

0a1cc923

Nonce

252,646

Timestamp

12/16/2013, 3:25:28 PM

Confirmations

6,498,533

Merkle Root

f7967c087946e6736633a8286b88fc084d3437ba41f5ad5dc924a362b0078305
Transactions (2)
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.190 × 10¹⁰⁰(101-digit number)
11909158166290762802…31638475863812555519
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.190 × 10¹⁰⁰(101-digit number)
11909158166290762802…31638475863812555519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.381 × 10¹⁰⁰(101-digit number)
23818316332581525605…63276951727625111039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.763 × 10¹⁰⁰(101-digit number)
47636632665163051210…26553903455250222079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.527 × 10¹⁰⁰(101-digit number)
95273265330326102421…53107806910500444159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.905 × 10¹⁰¹(102-digit number)
19054653066065220484…06215613821000888319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.810 × 10¹⁰¹(102-digit number)
38109306132130440968…12431227642001776639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.621 × 10¹⁰¹(102-digit number)
76218612264260881936…24862455284003553279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.524 × 10¹⁰²(103-digit number)
15243722452852176387…49724910568007106559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.048 × 10¹⁰²(103-digit number)
30487444905704352774…99449821136014213119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.097 × 10¹⁰²(103-digit number)
60974889811408705549…98899642272028426239
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,757,764 XPM·at block #6,814,211 · 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