Block #193,830

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/4/2013, 6:29:40 PM · Difficulty 9.8774 · 6,633,131 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f28f46692b33f490bab733a0312ae6a066b7b6c0fea3632e111ad820ba54a329

Height

#193,830

Difficulty

9.877409

Transactions

5

Size

1.22 KB

Version

2

Bits

09e09ddd

Nonce

15,192

Timestamp

10/4/2013, 6:29:40 PM

Confirmations

6,633,131

Merkle Root

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

7.657 × 10¹⁰¹(102-digit number)
76578885484763306488…50927260299870349761
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
7.657 × 10¹⁰¹(102-digit number)
76578885484763306488…50927260299870349761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.531 × 10¹⁰²(103-digit number)
15315777096952661297…01854520599740699521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.063 × 10¹⁰²(103-digit number)
30631554193905322595…03709041199481399041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.126 × 10¹⁰²(103-digit number)
61263108387810645190…07418082398962798081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.225 × 10¹⁰³(104-digit number)
12252621677562129038…14836164797925596161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.450 × 10¹⁰³(104-digit number)
24505243355124258076…29672329595851192321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.901 × 10¹⁰³(104-digit number)
49010486710248516152…59344659191702384641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.802 × 10¹⁰³(104-digit number)
98020973420497032305…18689318383404769281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.960 × 10¹⁰⁴(105-digit number)
19604194684099406461…37378636766809538561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.920 × 10¹⁰⁴(105-digit number)
39208389368198812922…74757273533619077121
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,859,864 XPM·at block #6,826,960 · 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