Block #2,141,557

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/2/2017, 7:55:59 AM · Difficulty 10.8741 · 4,685,635 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
27129c25935517dfdbd8ac492a6482484b5b38b25a38a88b4bfd6acced37fa4d

Height

#2,141,557

Difficulty

10.874097

Transactions

2

Size

1.28 KB

Version

2

Bits

0adfc4d7

Nonce

1,596,239,055

Timestamp

6/2/2017, 7:55:59 AM

Confirmations

4,685,635

Merkle Root

2f13e590ec7535b2c8489e54101e83640e0e26740c46245254453f0910a7e1ce
Transactions (2)
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.958 × 10⁹⁶(97-digit number)
19585515941763085724…30496641353584286721
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.958 × 10⁹⁶(97-digit number)
19585515941763085724…30496641353584286721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.917 × 10⁹⁶(97-digit number)
39171031883526171448…60993282707168573441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.834 × 10⁹⁶(97-digit number)
78342063767052342897…21986565414337146881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.566 × 10⁹⁷(98-digit number)
15668412753410468579…43973130828674293761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.133 × 10⁹⁷(98-digit number)
31336825506820937159…87946261657348587521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.267 × 10⁹⁷(98-digit number)
62673651013641874318…75892523314697175041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.253 × 10⁹⁸(99-digit number)
12534730202728374863…51785046629394350081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.506 × 10⁹⁸(99-digit number)
25069460405456749727…03570093258788700161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.013 × 10⁹⁸(99-digit number)
50138920810913499454…07140186517577400321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.002 × 10⁹⁹(100-digit number)
10027784162182699890…14280373035154800641
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,861,631 XPM·at block #6,827,191 · 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