Block #303,038

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/10/2013, 3:51:08 AM · Difficulty 9.9929 · 6,513,962 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a00efb1804d1d51813d554a4f475a5deb3f241d4ac41ea81e85865e8b97a7632

Height

#303,038

Difficulty

9.992898

Transactions

6

Size

2.10 KB

Version

2

Bits

09fe2e8e

Nonce

392,892

Timestamp

12/10/2013, 3:51:08 AM

Confirmations

6,513,962

Merkle Root

2d4d9ddf12534c92b37b01e74d747e16c2818aac21bee6366dee17fef65e1ebb
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.664 × 10⁹⁶(97-digit number)
56643948335538114895…83808390084057178879
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.664 × 10⁹⁶(97-digit number)
56643948335538114895…83808390084057178879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.132 × 10⁹⁷(98-digit number)
11328789667107622979…67616780168114357759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.265 × 10⁹⁷(98-digit number)
22657579334215245958…35233560336228715519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.531 × 10⁹⁷(98-digit number)
45315158668430491916…70467120672457431039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.063 × 10⁹⁷(98-digit number)
90630317336860983832…40934241344914862079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.812 × 10⁹⁸(99-digit number)
18126063467372196766…81868482689829724159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.625 × 10⁹⁸(99-digit number)
36252126934744393532…63736965379659448319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.250 × 10⁹⁸(99-digit number)
72504253869488787065…27473930759318896639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.450 × 10⁹⁹(100-digit number)
14500850773897757413…54947861518637793279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.900 × 10⁹⁹(100-digit number)
29001701547795514826…09895723037275586559
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,780,032 XPM·at block #6,816,999 · 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