Block #360,211

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/15/2014, 7:40:25 AM · Difficulty 10.3901 · 6,465,154 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2840414603e345892732c88df2a426de2df846ad27b6fa90f3c9cb7bf14a8103

Height

#360,211

Difficulty

10.390085

Transactions

9

Size

4.94 KB

Version

2

Bits

0a63dc96

Nonce

33,559,519

Timestamp

1/15/2014, 7:40:25 AM

Confirmations

6,465,154

Merkle Root

1b28652b9d4fc9b5f707c12f657399072b892726b537379d269ed72855c1807e
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.583 × 10⁹⁶(97-digit number)
25836648829452193160…54588497759231809919
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.583 × 10⁹⁶(97-digit number)
25836648829452193160…54588497759231809919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.167 × 10⁹⁶(97-digit number)
51673297658904386321…09176995518463619839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.033 × 10⁹⁷(98-digit number)
10334659531780877264…18353991036927239679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.066 × 10⁹⁷(98-digit number)
20669319063561754528…36707982073854479359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.133 × 10⁹⁷(98-digit number)
41338638127123509057…73415964147708958719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.267 × 10⁹⁷(98-digit number)
82677276254247018114…46831928295417917439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.653 × 10⁹⁸(99-digit number)
16535455250849403622…93663856590835834879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.307 × 10⁹⁸(99-digit number)
33070910501698807245…87327713181671669759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.614 × 10⁹⁸(99-digit number)
66141821003397614491…74655426363343339519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.322 × 10⁹⁹(100-digit number)
13228364200679522898…49310852726686679039
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,847,016 XPM·at block #6,825,364 · 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