Block #1,935,870

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/12/2017, 12:16:05 PM · Difficulty 10.7647 · 4,881,907 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0fb491bb659d71a6f59baf00de0ed51408e84c9ac442db761767b6ce88096ca8

Height

#1,935,870

Difficulty

10.764684

Transactions

2

Size

3.14 KB

Version

2

Bits

0ac3c25d

Nonce

1,314,725,010

Timestamp

1/12/2017, 12:16:05 PM

Confirmations

4,881,907

Merkle Root

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

4.150 × 10⁹³(94-digit number)
41507348364948442354…52446706192412567039
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
4.150 × 10⁹³(94-digit number)
41507348364948442354…52446706192412567039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.301 × 10⁹³(94-digit number)
83014696729896884708…04893412384825134079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.660 × 10⁹⁴(95-digit number)
16602939345979376941…09786824769650268159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.320 × 10⁹⁴(95-digit number)
33205878691958753883…19573649539300536319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.641 × 10⁹⁴(95-digit number)
66411757383917507766…39147299078601072639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.328 × 10⁹⁵(96-digit number)
13282351476783501553…78294598157202145279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.656 × 10⁹⁵(96-digit number)
26564702953567003106…56589196314404290559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.312 × 10⁹⁵(96-digit number)
53129405907134006213…13178392628808581119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.062 × 10⁹⁶(97-digit number)
10625881181426801242…26356785257617162239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.125 × 10⁹⁶(97-digit number)
21251762362853602485…52713570515234324479
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,786,274 XPM·at block #6,817,776 · 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