Block #2,098,733

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/3/2017, 9:01:01 PM · Difficulty 10.8616 · 4,743,293 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7e6037264a1b179ce5458075f212b1067c36637da3fae69d279e5796190a329e

Height

#2,098,733

Difficulty

10.861613

Transactions

2

Size

390 B

Version

2

Bits

0adc92b1

Nonce

631,381,805

Timestamp

5/3/2017, 9:01:01 PM

Confirmations

4,743,293

Merkle Root

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

2.870 × 10⁹⁴(95-digit number)
28707885118068489734…18262373304295042361
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.870 × 10⁹⁴(95-digit number)
28707885118068489734…18262373304295042361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.741 × 10⁹⁴(95-digit number)
57415770236136979468…36524746608590084721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.148 × 10⁹⁵(96-digit number)
11483154047227395893…73049493217180169441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.296 × 10⁹⁵(96-digit number)
22966308094454791787…46098986434360338881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.593 × 10⁹⁵(96-digit number)
45932616188909583575…92197972868720677761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.186 × 10⁹⁵(96-digit number)
91865232377819167150…84395945737441355521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.837 × 10⁹⁶(97-digit number)
18373046475563833430…68791891474882711041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.674 × 10⁹⁶(97-digit number)
36746092951127666860…37583782949765422081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.349 × 10⁹⁶(97-digit number)
73492185902255333720…75167565899530844161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.469 × 10⁹⁷(98-digit number)
14698437180451066744…50335131799061688321
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,980,594 XPM·at block #6,842,025 · 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