Block #2,130,660

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/24/2017, 2:01:05 PM · Difficulty 10.9099 · 4,710,367 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
559f7bf0782575b3d4e57098d728c990c6fb9dce45e9645212532d91b360b2c4

Height

#2,130,660

Difficulty

10.909860

Transactions

4

Size

1.69 KB

Version

2

Bits

0ae8ec91

Nonce

2,048,947,524

Timestamp

5/24/2017, 2:01:05 PM

Confirmations

4,710,367

Merkle Root

3921317ce6a6a88e96df1745dbd7b8b9a091e51ef701d96329d1ce4da1747c9a
Transactions (4)
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.835 × 10⁹³(94-digit number)
18358070744655307088…66627177888783759359
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.835 × 10⁹³(94-digit number)
18358070744655307088…66627177888783759359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.671 × 10⁹³(94-digit number)
36716141489310614177…33254355777567518719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.343 × 10⁹³(94-digit number)
73432282978621228354…66508711555135037439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.468 × 10⁹⁴(95-digit number)
14686456595724245670…33017423110270074879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.937 × 10⁹⁴(95-digit number)
29372913191448491341…66034846220540149759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.874 × 10⁹⁴(95-digit number)
58745826382896982683…32069692441080299519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.174 × 10⁹⁵(96-digit number)
11749165276579396536…64139384882160599039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.349 × 10⁹⁵(96-digit number)
23498330553158793073…28278769764321198079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.699 × 10⁹⁵(96-digit number)
46996661106317586147…56557539528642396159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.399 × 10⁹⁵(96-digit number)
93993322212635172294…13115079057284792319
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,972,574 XPM·at block #6,841,026 · 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