Block #2,183,723

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/28/2017, 11:16:54 PM · Difficulty 10.9417 · 4,634,066 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
348305267c413692b9c57685f30e0ede0e32af212eb19ba8d253abce9120cb5c

Height

#2,183,723

Difficulty

10.941652

Transactions

2

Size

2.72 KB

Version

2

Bits

0af1101f

Nonce

121,252,319

Timestamp

6/28/2017, 11:16:54 PM

Confirmations

4,634,066

Merkle Root

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

5.506 × 10⁹²(93-digit number)
55066553220615374867…48671598263553450161
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
5.506 × 10⁹²(93-digit number)
55066553220615374867…48671598263553450161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.101 × 10⁹³(94-digit number)
11013310644123074973…97343196527106900321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.202 × 10⁹³(94-digit number)
22026621288246149947…94686393054213800641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.405 × 10⁹³(94-digit number)
44053242576492299894…89372786108427601281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.810 × 10⁹³(94-digit number)
88106485152984599788…78745572216855202561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.762 × 10⁹⁴(95-digit number)
17621297030596919957…57491144433710405121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.524 × 10⁹⁴(95-digit number)
35242594061193839915…14982288867420810241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.048 × 10⁹⁴(95-digit number)
70485188122387679831…29964577734841620481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.409 × 10⁹⁵(96-digit number)
14097037624477535966…59929155469683240961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.819 × 10⁹⁵(96-digit number)
28194075248955071932…19858310939366481921
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,786,371 XPM·at block #6,817,788 · 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