Block #1,236,386

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/14/2015, 12:35:07 PM · Difficulty 10.7549 · 5,570,994 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6a1f4db87aa3d074285854d9f136c2b32c48bf28782a5e4fe88acf19b99a180a

Height

#1,236,386

Difficulty

10.754933

Transactions

7

Size

18.02 KB

Version

2

Bits

0ac1434e

Nonce

1,272,663,336

Timestamp

9/14/2015, 12:35:07 PM

Confirmations

5,570,994

Merkle Root

c09ea99f3f452f07a278f4e89b11e7e46ef69c4bd19132db220b80fd30d37782
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.

5.944 × 10⁹²(93-digit number)
59446910460669770232…16603307328981854079
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
5.944 × 10⁹²(93-digit number)
59446910460669770232…16603307328981854079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.188 × 10⁹³(94-digit number)
11889382092133954046…33206614657963708159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.377 × 10⁹³(94-digit number)
23778764184267908093…66413229315927416319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.755 × 10⁹³(94-digit number)
47557528368535816186…32826458631854832639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.511 × 10⁹³(94-digit number)
95115056737071632372…65652917263709665279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.902 × 10⁹⁴(95-digit number)
19023011347414326474…31305834527419330559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.804 × 10⁹⁴(95-digit number)
38046022694828652949…62611669054838661119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.609 × 10⁹⁴(95-digit number)
76092045389657305898…25223338109677322239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.521 × 10⁹⁵(96-digit number)
15218409077931461179…50446676219354644479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.043 × 10⁹⁵(96-digit number)
30436818155862922359…00893352438709288959
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,703,063 XPM·at block #6,807,379 · 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