Block #2,135,503

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/28/2017, 6:55:11 AM · Difficulty 10.9008 · 4,706,335 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
09bcaf35a82b0b41f59d612a002b4ea407f6c530923aa950cfd56607431feceb

Height

#2,135,503

Difficulty

10.900812

Transactions

6

Size

1.30 KB

Version

2

Bits

0ae69b9a

Nonce

451,637,858

Timestamp

5/28/2017, 6:55:11 AM

Confirmations

4,706,335

Merkle Root

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

8.367 × 10⁹³(94-digit number)
83670910234362373810…65465645922253134479
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
8.367 × 10⁹³(94-digit number)
83670910234362373810…65465645922253134479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.673 × 10⁹⁴(95-digit number)
16734182046872474762…30931291844506268959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.346 × 10⁹⁴(95-digit number)
33468364093744949524…61862583689012537919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.693 × 10⁹⁴(95-digit number)
66936728187489899048…23725167378025075839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.338 × 10⁹⁵(96-digit number)
13387345637497979809…47450334756050151679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.677 × 10⁹⁵(96-digit number)
26774691274995959619…94900669512100303359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.354 × 10⁹⁵(96-digit number)
53549382549991919239…89801339024200606719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.070 × 10⁹⁶(97-digit number)
10709876509998383847…79602678048401213439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.141 × 10⁹⁶(97-digit number)
21419753019996767695…59205356096802426879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.283 × 10⁹⁶(97-digit number)
42839506039993535391…18410712193604853759
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,979,078 XPM·at block #6,841,837 · 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