Block #310,261

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/13/2013, 11:52:48 PM · Difficulty 9.9951 · 6,505,940 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
44a2ad3861487b138500453568ba8fd3edf4f5ac61416da570e5efe45fd58573

Height

#310,261

Difficulty

9.995124

Transactions

11

Size

2.95 KB

Version

2

Bits

09fec06c

Nonce

171,640

Timestamp

12/13/2013, 11:52:48 PM

Confirmations

6,505,940

Merkle Root

f279f9b27042d71f240eb83466350468d02bb32d9a111887419d5e17f2866fc8
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.415 × 10⁹⁶(97-digit number)
24153024702179899382…29358968476103368319
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.415 × 10⁹⁶(97-digit number)
24153024702179899382…29358968476103368319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.830 × 10⁹⁶(97-digit number)
48306049404359798765…58717936952206736639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.661 × 10⁹⁶(97-digit number)
96612098808719597530…17435873904413473279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.932 × 10⁹⁷(98-digit number)
19322419761743919506…34871747808826946559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.864 × 10⁹⁷(98-digit number)
38644839523487839012…69743495617653893119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.728 × 10⁹⁷(98-digit number)
77289679046975678024…39486991235307786239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.545 × 10⁹⁸(99-digit number)
15457935809395135604…78973982470615572479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.091 × 10⁹⁸(99-digit number)
30915871618790271209…57947964941231144959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.183 × 10⁹⁸(99-digit number)
61831743237580542419…15895929882462289919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.236 × 10⁹⁹(100-digit number)
12366348647516108483…31791859764924579839
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,773,734 XPM·at block #6,816,200 · 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