Block #351,150

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/9/2014, 12:32:50 PM · Difficulty 10.2933 · 6,475,958 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c20d4a9227ef587f04a2a0e57a7bf606a02d39143e4fe91be24ffc06e0cefe96

Height

#351,150

Difficulty

10.293334

Transactions

13

Size

4.40 KB

Version

2

Bits

0a4b17f4

Nonce

46,705

Timestamp

1/9/2014, 12:32:50 PM

Confirmations

6,475,958

Merkle Root

4957fe13922545a590eca01db9112a745fd283654d149098f04baaf7877a3173
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.463 × 10¹⁰⁰(101-digit number)
24630637598837650197…02316200250619041279
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.463 × 10¹⁰⁰(101-digit number)
24630637598837650197…02316200250619041279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.926 × 10¹⁰⁰(101-digit number)
49261275197675300395…04632400501238082559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.852 × 10¹⁰⁰(101-digit number)
98522550395350600790…09264801002476165119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.970 × 10¹⁰¹(102-digit number)
19704510079070120158…18529602004952330239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.940 × 10¹⁰¹(102-digit number)
39409020158140240316…37059204009904660479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.881 × 10¹⁰¹(102-digit number)
78818040316280480632…74118408019809320959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.576 × 10¹⁰²(103-digit number)
15763608063256096126…48236816039618641919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.152 × 10¹⁰²(103-digit number)
31527216126512192253…96473632079237283839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.305 × 10¹⁰²(103-digit number)
63054432253024384506…92947264158474567679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.261 × 10¹⁰³(104-digit number)
12610886450604876901…85894528316949135359
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,861,042 XPM·at block #6,827,107 · 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