Block #1,683,834

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/21/2016, 9:47:39 PM · Difficulty 10.7248 · 5,158,160 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
528b4cae06162530a8f144fa5994c74818bf59f7889dbd125a02857842b87051

Height

#1,683,834

Difficulty

10.724830

Transactions

41

Size

14.78 KB

Version

2

Bits

0ab98e79

Nonce

692,341,753

Timestamp

7/21/2016, 9:47:39 PM

Confirmations

5,158,160

Merkle Root

fcdaf522e2bbb83419372a325cd54a9088be58ac6cb665251c027b33afbeb250
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.970 × 10⁹³(94-digit number)
19706435468979572524…86346756256908755201
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.970 × 10⁹³(94-digit number)
19706435468979572524…86346756256908755201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.941 × 10⁹³(94-digit number)
39412870937959145048…72693512513817510401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.882 × 10⁹³(94-digit number)
78825741875918290097…45387025027635020801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.576 × 10⁹⁴(95-digit number)
15765148375183658019…90774050055270041601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.153 × 10⁹⁴(95-digit number)
31530296750367316039…81548100110540083201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.306 × 10⁹⁴(95-digit number)
63060593500734632078…63096200221080166401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.261 × 10⁹⁵(96-digit number)
12612118700146926415…26192400442160332801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.522 × 10⁹⁵(96-digit number)
25224237400293852831…52384800884320665601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.044 × 10⁹⁵(96-digit number)
50448474800587705662…04769601768641331201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.008 × 10⁹⁶(97-digit number)
10089694960117541132…09539203537282662401
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,340 XPM·at block #6,841,993 · 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