Block #1,578,100

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/9/2016, 11:04:26 PM · Difficulty 10.6801 · 5,238,908 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0d584b6e8b0003b9f1800c47dc79056a4e94d9cf0e79285a27b4847506bb9337

Height

#1,578,100

Difficulty

10.680057

Transactions

3

Size

4.24 KB

Version

2

Bits

0aae183b

Nonce

352,497,046

Timestamp

5/9/2016, 11:04:26 PM

Confirmations

5,238,908

Merkle Root

fbf7a6541397aa10120994340170df1a2e887de3849a034dc144d3a3e810fe14
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.904 × 10⁹⁴(95-digit number)
29040138671392063819…88639901383060351159
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.904 × 10⁹⁴(95-digit number)
29040138671392063819…88639901383060351159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.808 × 10⁹⁴(95-digit number)
58080277342784127638…77279802766120702319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.161 × 10⁹⁵(96-digit number)
11616055468556825527…54559605532241404639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.323 × 10⁹⁵(96-digit number)
23232110937113651055…09119211064482809279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.646 × 10⁹⁵(96-digit number)
46464221874227302111…18238422128965618559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.292 × 10⁹⁵(96-digit number)
92928443748454604222…36476844257931237119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.858 × 10⁹⁶(97-digit number)
18585688749690920844…72953688515862474239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.717 × 10⁹⁶(97-digit number)
37171377499381841688…45907377031724948479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.434 × 10⁹⁶(97-digit number)
74342754998763683377…91814754063449896959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.486 × 10⁹⁷(98-digit number)
14868550999752736675…83629508126899793919
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,780,098 XPM·at block #6,817,007 · 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