Block #309,033

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/13/2013, 9:47:28 AM · Difficulty 9.9947 · 6,532,905 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
215b9a129e5535247345f1639fdb56019c75ef8ba003fc25ee9d86ae3e18eaa5

Height

#309,033

Difficulty

9.994701

Transactions

8

Size

6.77 KB

Version

2

Bits

09fea4be

Nonce

76,660

Timestamp

12/13/2013, 9:47:28 AM

Confirmations

6,532,905

Merkle Root

570c7f92d8098527dc45e9e3518ca69669ef2b51cf102b27c962d3e79d4acf1b
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.349 × 10⁹³(94-digit number)
23497013545681191132…96657503016922240719
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.349 × 10⁹³(94-digit number)
23497013545681191132…96657503016922240719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.699 × 10⁹³(94-digit number)
46994027091362382265…93315006033844481439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.398 × 10⁹³(94-digit number)
93988054182724764530…86630012067688962879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.879 × 10⁹⁴(95-digit number)
18797610836544952906…73260024135377925759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.759 × 10⁹⁴(95-digit number)
37595221673089905812…46520048270755851519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.519 × 10⁹⁴(95-digit number)
75190443346179811624…93040096541511703039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.503 × 10⁹⁵(96-digit number)
15038088669235962324…86080193083023406079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.007 × 10⁹⁵(96-digit number)
30076177338471924649…72160386166046812159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.015 × 10⁹⁵(96-digit number)
60152354676943849299…44320772332093624319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.203 × 10⁹⁶(97-digit number)
12030470935388769859…88641544664187248639
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,979,884 XPM·at block #6,841,937 · 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