Block #1,628,143

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/14/2016, 1:03:16 PM · Difficulty 10.5968 · 5,189,797 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b5c235750eb8bd682ac05f9172d456e374a26c0a5eb31107ac227bd20b0e3564

Height

#1,628,143

Difficulty

10.596779

Transactions

2

Size

17.74 KB

Version

2

Bits

0a98c67a

Nonce

435,651,461

Timestamp

6/14/2016, 1:03:16 PM

Confirmations

5,189,797

Merkle Root

872748d7bb1b7eeed8bf687de69e8cd81e13fe03defefe26884d9ac0eec9bd02
Transactions (2)
1 in → 1 out9.3100 XPM109 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.

2.778 × 10⁹⁵(96-digit number)
27789688611824892440…28900307686903259199
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.778 × 10⁹⁵(96-digit number)
27789688611824892440…28900307686903259199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.557 × 10⁹⁵(96-digit number)
55579377223649784880…57800615373806518399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.111 × 10⁹⁶(97-digit number)
11115875444729956976…15601230747613036799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.223 × 10⁹⁶(97-digit number)
22231750889459913952…31202461495226073599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.446 × 10⁹⁶(97-digit number)
44463501778919827904…62404922990452147199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.892 × 10⁹⁶(97-digit number)
88927003557839655809…24809845980904294399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.778 × 10⁹⁷(98-digit number)
17785400711567931161…49619691961808588799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.557 × 10⁹⁷(98-digit number)
35570801423135862323…99239383923617177599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.114 × 10⁹⁷(98-digit number)
71141602846271724647…98478767847234355199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.422 × 10⁹⁸(99-digit number)
14228320569254344929…96957535694468710399
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,787,586 XPM·at block #6,817,939 · 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