Block #306,883

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/12/2013, 7:29:59 AM · Difficulty 9.9940 · 6,507,969 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6580bd104412a8fad0214b284603c1fb32ecd9eda4bb50301a427ff502a897b6

Height

#306,883

Difficulty

9.993993

Transactions

16

Size

5.62 KB

Version

2

Bits

09fe7650

Nonce

202,143

Timestamp

12/12/2013, 7:29:59 AM

Confirmations

6,507,969

Merkle Root

7eefcdd9e5206b93384c54aecab841ed8accdab0f6db8ec646d7253ee79450ac
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.720 × 10⁹⁸(99-digit number)
17207296930891220564…10894666533645475839
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.720 × 10⁹⁸(99-digit number)
17207296930891220564…10894666533645475839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.441 × 10⁹⁸(99-digit number)
34414593861782441128…21789333067290951679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.882 × 10⁹⁸(99-digit number)
68829187723564882256…43578666134581903359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.376 × 10⁹⁹(100-digit number)
13765837544712976451…87157332269163806719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.753 × 10⁹⁹(100-digit number)
27531675089425952902…74314664538327613439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.506 × 10⁹⁹(100-digit number)
55063350178851905805…48629329076655226879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.101 × 10¹⁰⁰(101-digit number)
11012670035770381161…97258658153310453759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.202 × 10¹⁰⁰(101-digit number)
22025340071540762322…94517316306620907519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.405 × 10¹⁰⁰(101-digit number)
44050680143081524644…89034632613241815039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.810 × 10¹⁰⁰(101-digit number)
88101360286163049288…78069265226483630079
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,762,899 XPM·at block #6,814,851 · 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