Block #1,927,591

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/7/2017, 1:03:17 AM · Difficulty 10.7445 · 4,916,409 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d197219234a758a984dc9cd07f22e4e819de9f165fde40da166d982b8134a3bc

Height

#1,927,591

Difficulty

10.744536

Transactions

2

Size

984 B

Version

2

Bits

0abe99e7

Nonce

77,695,487

Timestamp

1/7/2017, 1:03:17 AM

Confirmations

4,916,409

Merkle Root

0cfd985636bf95d7fcd01407381e464277da710868f7dbc32c991319f7e7194b
Transactions (2)
1 in → 1 out8.6600 XPM109 B
5 in → 1 out3999.9900 XPM784 B
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.686 × 10⁹⁶(97-digit number)
16868001903059983151…60217888621199270399
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.686 × 10⁹⁶(97-digit number)
16868001903059983151…60217888621199270399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.373 × 10⁹⁶(97-digit number)
33736003806119966302…20435777242398540799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.747 × 10⁹⁶(97-digit number)
67472007612239932605…40871554484797081599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.349 × 10⁹⁷(98-digit number)
13494401522447986521…81743108969594163199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.698 × 10⁹⁷(98-digit number)
26988803044895973042…63486217939188326399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.397 × 10⁹⁷(98-digit number)
53977606089791946084…26972435878376652799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.079 × 10⁹⁸(99-digit number)
10795521217958389216…53944871756753305599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.159 × 10⁹⁸(99-digit number)
21591042435916778433…07889743513506611199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.318 × 10⁹⁸(99-digit number)
43182084871833556867…15779487027013222399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.636 × 10⁹⁸(99-digit number)
86364169743667113735…31558974054026444799
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,996,382 XPM·at block #6,843,999 · 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