Block #1,378,015

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/21/2015, 2:05:25 AM · Difficulty 10.8101 · 5,438,451 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b038e7c210fe21cfc97e9ab8078bf2ea3c0034f150020ed966912c0c56c69872

Height

#1,378,015

Difficulty

10.810090

Transactions

2

Size

27.44 KB

Version

2

Bits

0acf6210

Nonce

1,087,197,995

Timestamp

12/21/2015, 2:05:25 AM

Confirmations

5,438,451

Merkle Root

5861571b07f0d7ad510abfaaf2b80c04be66d69768e3c9d6ff180367ad549bf0
Transactions (2)
1 in → 1 out8.8300 XPM110 B
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.

1.645 × 10⁹³(94-digit number)
16453799736309066760…43468445010389128039
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
1.645 × 10⁹³(94-digit number)
16453799736309066760…43468445010389128039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.290 × 10⁹³(94-digit number)
32907599472618133520…86936890020778256079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.581 × 10⁹³(94-digit number)
65815198945236267040…73873780041556512159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.316 × 10⁹⁴(95-digit number)
13163039789047253408…47747560083113024319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.632 × 10⁹⁴(95-digit number)
26326079578094506816…95495120166226048639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.265 × 10⁹⁴(95-digit number)
52652159156189013632…90990240332452097279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.053 × 10⁹⁵(96-digit number)
10530431831237802726…81980480664904194559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.106 × 10⁹⁵(96-digit number)
21060863662475605452…63960961329808389119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.212 × 10⁹⁵(96-digit number)
42121727324951210905…27921922659616778239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.424 × 10⁹⁵(96-digit number)
84243454649902421811…55843845319233556479
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,775,857 XPM·at block #6,816,465 · 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