Block #316,856

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/17/2013, 7:52:19 AM · Difficulty 10.1455 · 6,507,719 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
295760b1ea426572ae7911e918414cfbeaf7a28e0c28a72d73c22bced5bb9992

Height

#316,856

Difficulty

10.145535

Transactions

8

Size

2.64 KB

Version

2

Bits

0a2541c1

Nonce

309,562

Timestamp

12/17/2013, 7:52:19 AM

Confirmations

6,507,719

Merkle Root

386817f56d3c7f7807cf19a7d01d209025d7a442ceb409a2782f4814116c7ad8
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.484 × 10⁹⁴(95-digit number)
14846870154900889715…50672363761379023999
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.484 × 10⁹⁴(95-digit number)
14846870154900889715…50672363761379023999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.969 × 10⁹⁴(95-digit number)
29693740309801779430…01344727522758047999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.938 × 10⁹⁴(95-digit number)
59387480619603558861…02689455045516095999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.187 × 10⁹⁵(96-digit number)
11877496123920711772…05378910091032191999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.375 × 10⁹⁵(96-digit number)
23754992247841423544…10757820182064383999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.750 × 10⁹⁵(96-digit number)
47509984495682847089…21515640364128767999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.501 × 10⁹⁵(96-digit number)
95019968991365694179…43031280728257535999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.900 × 10⁹⁶(97-digit number)
19003993798273138835…86062561456515071999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.800 × 10⁹⁶(97-digit number)
38007987596546277671…72125122913030143999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.601 × 10⁹⁶(97-digit number)
76015975193092555343…44250245826060287999
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,840,666 XPM·at block #6,824,574 · 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