Block #310,325

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/14/2013, 12:36:26 AM · Difficulty 9.9951 · 6,534,874 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6e57958d748ef08745430fa8b333bf0ab0f49edf7f58ac37162d976373f33916

Height

#310,325

Difficulty

9.995145

Transactions

1

Size

1003 B

Version

2

Bits

09fec1cf

Nonce

69,997

Timestamp

12/14/2013, 12:36:26 AM

Confirmations

6,534,874

Merkle Root

cb733df98db041d4b48e299dbb25e12664b7c26b206da094f4a100bf35fda99a
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.

5.738 × 10⁹⁵(96-digit number)
57383904392933075820…95025805769925887999
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
5.738 × 10⁹⁵(96-digit number)
57383904392933075820…95025805769925887999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.147 × 10⁹⁶(97-digit number)
11476780878586615164…90051611539851775999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.295 × 10⁹⁶(97-digit number)
22953561757173230328…80103223079703551999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.590 × 10⁹⁶(97-digit number)
45907123514346460656…60206446159407103999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.181 × 10⁹⁶(97-digit number)
91814247028692921312…20412892318814207999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.836 × 10⁹⁷(98-digit number)
18362849405738584262…40825784637628415999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.672 × 10⁹⁷(98-digit number)
36725698811477168524…81651569275256831999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.345 × 10⁹⁷(98-digit number)
73451397622954337049…63303138550513663999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.469 × 10⁹⁸(99-digit number)
14690279524590867409…26606277101027327999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.938 × 10⁹⁸(99-digit number)
29380559049181734819…53212554202054655999
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:58,006,024 XPM·at block #6,845,198 · 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