Block #303,429

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/10/2013, 9:10:20 AM · Difficulty 9.9930 · 6,506,441 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a088385be6ae8a1e61d65876805fa276888de5741d3f7cb57bec53664120d667

Height

#303,429

Difficulty

9.993010

Transactions

20

Size

5.23 KB

Version

2

Bits

09fe35e4

Nonce

30,315

Timestamp

12/10/2013, 9:10:20 AM

Confirmations

6,506,441

Merkle Root

1927d5d61ec2e4c1a78f501e4c3583375813265ed49989a4baf44394dca4e53b
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.077 × 10⁹⁴(95-digit number)
10776790818473136018…31252223570569912319
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.077 × 10⁹⁴(95-digit number)
10776790818473136018…31252223570569912319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.155 × 10⁹⁴(95-digit number)
21553581636946272037…62504447141139824639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.310 × 10⁹⁴(95-digit number)
43107163273892544075…25008894282279649279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.621 × 10⁹⁴(95-digit number)
86214326547785088151…50017788564559298559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.724 × 10⁹⁵(96-digit number)
17242865309557017630…00035577129118597119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.448 × 10⁹⁵(96-digit number)
34485730619114035260…00071154258237194239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.897 × 10⁹⁵(96-digit number)
68971461238228070521…00142308516474388479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.379 × 10⁹⁶(97-digit number)
13794292247645614104…00284617032948776959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.758 × 10⁹⁶(97-digit number)
27588584495291228208…00569234065897553919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.517 × 10⁹⁶(97-digit number)
55177168990582456416…01138468131795107839
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,723,049 XPM·at block #6,809,869 · 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