Block #2,142,167

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/2/2017, 5:59:56 PM · Difficulty 10.8743 · 4,690,869 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9aed46147af6d2d03cca85380f6f4c6212cbbf6ab78aedd550e019341724c3a4

Height

#2,142,167

Difficulty

10.874280

Transactions

3

Size

1.33 KB

Version

2

Bits

0adfd0d7

Nonce

1,611,074,003

Timestamp

6/2/2017, 5:59:56 PM

Confirmations

4,690,869

Merkle Root

9195bc59753f7d002cc53096a6498c73c0bc51c8c10ed7dcc6b295d7d02284c7
Transactions (3)
1 in → 1 out8.4600 XPM110 B
2 in → 1 out2500.0000 XPM340 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.

4.146 × 10⁹²(93-digit number)
41465181969745262832…25122556407806793321
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
4.146 × 10⁹²(93-digit number)
41465181969745262832…25122556407806793321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.293 × 10⁹²(93-digit number)
82930363939490525665…50245112815613586641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.658 × 10⁹³(94-digit number)
16586072787898105133…00490225631227173281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.317 × 10⁹³(94-digit number)
33172145575796210266…00980451262454346561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.634 × 10⁹³(94-digit number)
66344291151592420532…01960902524908693121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.326 × 10⁹⁴(95-digit number)
13268858230318484106…03921805049817386241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.653 × 10⁹⁴(95-digit number)
26537716460636968213…07843610099634772481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.307 × 10⁹⁴(95-digit number)
53075432921273936426…15687220199269544961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.061 × 10⁹⁵(96-digit number)
10615086584254787285…31374440398539089921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.123 × 10⁹⁵(96-digit number)
21230173168509574570…62748880797078179841
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,908,466 XPM·at block #6,833,035 · 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