Block #357,403

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/13/2014, 9:32:38 AM · Difficulty 10.3843 · 6,456,611 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
68068b5cfa76856f1fd5bedc3a072d4c070a0b21ebe43bee3824cb9a00452175

Height

#357,403

Difficulty

10.384316

Transactions

5

Size

1.23 KB

Version

2

Bits

0a626283

Nonce

9,777

Timestamp

1/13/2014, 9:32:38 AM

Confirmations

6,456,611

Merkle Root

0d85264343fa210204b1b4778ef3b477c321372c1a74d0f50d99eae1df731a2b
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.

7.428 × 10¹⁰³(104-digit number)
74281420316288679176…52585996105573990399
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
7.428 × 10¹⁰³(104-digit number)
74281420316288679176…52585996105573990399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.485 × 10¹⁰⁴(105-digit number)
14856284063257735835…05171992211147980799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.971 × 10¹⁰⁴(105-digit number)
29712568126515471670…10343984422295961599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.942 × 10¹⁰⁴(105-digit number)
59425136253030943341…20687968844591923199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.188 × 10¹⁰⁵(106-digit number)
11885027250606188668…41375937689183846399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.377 × 10¹⁰⁵(106-digit number)
23770054501212377336…82751875378367692799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.754 × 10¹⁰⁵(106-digit number)
47540109002424754673…65503750756735385599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.508 × 10¹⁰⁵(106-digit number)
95080218004849509346…31007501513470771199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.901 × 10¹⁰⁶(107-digit number)
19016043600969901869…62015003026941542399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.803 × 10¹⁰⁶(107-digit number)
38032087201939803738…24030006053883084799
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,756,195 XPM·at block #6,814,013 · 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