Block #350,568

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/9/2014, 3:44:31 AM · Difficulty 10.2856 · 6,466,025 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b6653cdb1dfeb5778a6a3bece44cbf9ac0fbd21cf65ebe0976fcf2003c3d6263

Height

#350,568

Difficulty

10.285585

Transactions

2

Size

1.76 KB

Version

2

Bits

0a491c1b

Nonce

6,667

Timestamp

1/9/2014, 3:44:31 AM

Confirmations

6,466,025

Merkle Root

4ef9ae61d8eadf8c4569f2c8b464ac60b3fdfce0eca9b7890b94727bc9584e8c
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.

3.024 × 10⁹⁴(95-digit number)
30241648685776002955…66840391321847866759
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
3.024 × 10⁹⁴(95-digit number)
30241648685776002955…66840391321847866759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.048 × 10⁹⁴(95-digit number)
60483297371552005911…33680782643695733519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.209 × 10⁹⁵(96-digit number)
12096659474310401182…67361565287391467039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.419 × 10⁹⁵(96-digit number)
24193318948620802364…34723130574782934079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.838 × 10⁹⁵(96-digit number)
48386637897241604729…69446261149565868159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.677 × 10⁹⁵(96-digit number)
96773275794483209458…38892522299131736319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.935 × 10⁹⁶(97-digit number)
19354655158896641891…77785044598263472639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.870 × 10⁹⁶(97-digit number)
38709310317793283783…55570089196526945279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.741 × 10⁹⁶(97-digit number)
77418620635586567567…11140178393053890559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.548 × 10⁹⁷(98-digit number)
15483724127117313513…22280356786107781119
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,776,868 XPM·at block #6,816,592 · 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