Block #331,306

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/27/2013, 7:06:47 AM · Difficulty 10.1659 · 6,485,576 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
21689775a8f130ee175ea3c29b78abde8bf055b3f581ab0e28619e6d0c15e870

Height

#331,306

Difficulty

10.165871

Transactions

8

Size

5.04 KB

Version

2

Bits

0a2a7684

Nonce

7,898

Timestamp

12/27/2013, 7:06:47 AM

Confirmations

6,485,576

Merkle Root

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

2.748 × 10⁹²(93-digit number)
27487812394589593339…69711269639692116379
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
2.748 × 10⁹²(93-digit number)
27487812394589593339…69711269639692116379
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.497 × 10⁹²(93-digit number)
54975624789179186679…39422539279384232759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.099 × 10⁹³(94-digit number)
10995124957835837335…78845078558768465519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.199 × 10⁹³(94-digit number)
21990249915671674671…57690157117536931039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.398 × 10⁹³(94-digit number)
43980499831343349343…15380314235073862079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.796 × 10⁹³(94-digit number)
87960999662686698687…30760628470147724159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.759 × 10⁹⁴(95-digit number)
17592199932537339737…61521256940295448319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.518 × 10⁹⁴(95-digit number)
35184399865074679474…23042513880590896639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.036 × 10⁹⁴(95-digit number)
70368799730149358949…46085027761181793279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.407 × 10⁹⁵(96-digit number)
14073759946029871789…92170055522363586559
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,779,095 XPM·at block #6,816,881 · 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