Block #1,527,042

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/5/2016, 5:04:27 AM · Difficulty 10.6056 · 5,299,142 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
28f877dccd81de45768245edcffeb293324ccbc66d48f6081c9963faa6febc89

Height

#1,527,042

Difficulty

10.605623

Transactions

2

Size

1002 B

Version

2

Bits

0a9b0a21

Nonce

216,808,893

Timestamp

4/5/2016, 5:04:27 AM

Confirmations

5,299,142

Merkle Root

c3267801afafacb160a60d52845b6a4abafcecfa458ac0eb701dcda202084ffb
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.783 × 10⁹⁴(95-digit number)
17833148924288688506…12943056706055307559
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.783 × 10⁹⁴(95-digit number)
17833148924288688506…12943056706055307559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.566 × 10⁹⁴(95-digit number)
35666297848577377013…25886113412110615119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.133 × 10⁹⁴(95-digit number)
71332595697154754027…51772226824221230239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.426 × 10⁹⁵(96-digit number)
14266519139430950805…03544453648442460479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.853 × 10⁹⁵(96-digit number)
28533038278861901611…07088907296884920959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.706 × 10⁹⁵(96-digit number)
57066076557723803222…14177814593769841919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.141 × 10⁹⁶(97-digit number)
11413215311544760644…28355629187539683839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.282 × 10⁹⁶(97-digit number)
22826430623089521288…56711258375079367679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.565 × 10⁹⁶(97-digit number)
45652861246179042577…13422516750158735359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.130 × 10⁹⁶(97-digit number)
91305722492358085155…26845033500317470719
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,853,601 XPM·at block #6,826,183 · 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