Block #359,815

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/15/2014, 1:21:48 AM · Difficulty 10.3876 · 6,452,649 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
18aaea6b8ebaf165fc1eac304b0f47fda987288db88f71cb48db51f0d57f1e39

Height

#359,815

Difficulty

10.387637

Transactions

5

Size

1.81 KB

Version

2

Bits

0a633c2a

Nonce

2,111

Timestamp

1/15/2014, 1:21:48 AM

Confirmations

6,452,649

Merkle Root

e27b49e8f9580820d9948b894a8c6bc6e44d20e44be9122d7e9f6a816ffaf91c
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.352 × 10¹⁰³(104-digit number)
23522601586932192589…85068306642533089279
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.352 × 10¹⁰³(104-digit number)
23522601586932192589…85068306642533089279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.704 × 10¹⁰³(104-digit number)
47045203173864385178…70136613285066178559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.409 × 10¹⁰³(104-digit number)
94090406347728770356…40273226570132357119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.881 × 10¹⁰⁴(105-digit number)
18818081269545754071…80546453140264714239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.763 × 10¹⁰⁴(105-digit number)
37636162539091508142…61092906280529428479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.527 × 10¹⁰⁴(105-digit number)
75272325078183016285…22185812561058856959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.505 × 10¹⁰⁵(106-digit number)
15054465015636603257…44371625122117713919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.010 × 10¹⁰⁵(106-digit number)
30108930031273206514…88743250244235427839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.021 × 10¹⁰⁵(106-digit number)
60217860062546413028…77486500488470855679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.204 × 10¹⁰⁶(107-digit number)
12043572012509282605…54973000976941711359
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,743,738 XPM·at block #6,812,463 · 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.

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