Block #307,442

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/12/2013, 2:36:33 PM · Difficulty 9.9942 · 6,506,736 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
007157be40c9780ba26fc4f202609e5e2f1fa155a551c0bd8fa7197c28bc18a2

Height

#307,442

Difficulty

9.994169

Transactions

19

Size

9.47 KB

Version

2

Bits

09fe81e2

Nonce

22,228

Timestamp

12/12/2013, 2:36:33 PM

Confirmations

6,506,736

Merkle Root

eff6c7ffcef90d9ffba11f673cbda16bf7ce48af3f763be97d4ac284ab80c6a1
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.

8.798 × 10⁹⁴(95-digit number)
87984817118270342811…44114144764272673399
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
8.798 × 10⁹⁴(95-digit number)
87984817118270342811…44114144764272673399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.759 × 10⁹⁵(96-digit number)
17596963423654068562…88228289528545346799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.519 × 10⁹⁵(96-digit number)
35193926847308137124…76456579057090693599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.038 × 10⁹⁵(96-digit number)
70387853694616274249…52913158114181387199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.407 × 10⁹⁶(97-digit number)
14077570738923254849…05826316228362774399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.815 × 10⁹⁶(97-digit number)
28155141477846509699…11652632456725548799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.631 × 10⁹⁶(97-digit number)
56310282955693019399…23305264913451097599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.126 × 10⁹⁷(98-digit number)
11262056591138603879…46610529826902195199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.252 × 10⁹⁷(98-digit number)
22524113182277207759…93221059653804390399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.504 × 10⁹⁷(98-digit number)
45048226364554415519…86442119307608780799
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,757,496 XPM·at block #6,814,177 · 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