Block #1,719,643

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/16/2016, 9:30:24 AM · Difficulty 10.6727 · 5,121,113 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
93e33766b62797dc969cf95bb31caa648631cd8b6fb500ff0790e576f089a572

Height

#1,719,643

Difficulty

10.672696

Transactions

2

Size

424 B

Version

2

Bits

0aac35d1

Nonce

128,319,269

Timestamp

8/16/2016, 9:30:24 AM

Confirmations

5,121,113

Merkle Root

80edd427eeb0ac828d32245930097a50b173d8aeba122b22b6547f90c27f6b78
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.428 × 10⁹²(93-digit number)
14289880738936720038…71385256505154005599
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.428 × 10⁹²(93-digit number)
14289880738936720038…71385256505154005599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.857 × 10⁹²(93-digit number)
28579761477873440076…42770513010308011199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.715 × 10⁹²(93-digit number)
57159522955746880153…85541026020616022399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.143 × 10⁹³(94-digit number)
11431904591149376030…71082052041232044799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.286 × 10⁹³(94-digit number)
22863809182298752061…42164104082464089599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.572 × 10⁹³(94-digit number)
45727618364597504122…84328208164928179199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.145 × 10⁹³(94-digit number)
91455236729195008245…68656416329856358399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.829 × 10⁹⁴(95-digit number)
18291047345839001649…37312832659712716799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.658 × 10⁹⁴(95-digit number)
36582094691678003298…74625665319425433599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.316 × 10⁹⁴(95-digit number)
73164189383356006596…49251330638850867199
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,970,389 XPM·at block #6,840,755 · 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