Block #2,077,897

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/19/2017, 3:19:13 PM · Difficulty 10.8514 · 4,767,129 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3890077c547f03d6ce3bc6ce46ea368c07e1adaeb9c4cfc87af025f855195b12

Height

#2,077,897

Difficulty

10.851399

Transactions

2

Size

1.57 KB

Version

2

Bits

0ad9f541

Nonce

589,482,046

Timestamp

4/19/2017, 3:19:13 PM

Confirmations

4,767,129

Merkle Root

578855cfb5a7ab26a1ff4ecba04ae5a84e48a93d89162f216c29503bd5f0c5df
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.

3.058 × 10⁹²(93-digit number)
30582181762773695860…43631259184041627919
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
3.058 × 10⁹²(93-digit number)
30582181762773695860…43631259184041627919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.116 × 10⁹²(93-digit number)
61164363525547391720…87262518368083255839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.223 × 10⁹³(94-digit number)
12232872705109478344…74525036736166511679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.446 × 10⁹³(94-digit number)
24465745410218956688…49050073472333023359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.893 × 10⁹³(94-digit number)
48931490820437913376…98100146944666046719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.786 × 10⁹³(94-digit number)
97862981640875826753…96200293889332093439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.957 × 10⁹⁴(95-digit number)
19572596328175165350…92400587778664186879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.914 × 10⁹⁴(95-digit number)
39145192656350330701…84801175557328373759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.829 × 10⁹⁴(95-digit number)
78290385312700661402…69602351114656747519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.565 × 10⁹⁵(96-digit number)
15658077062540132280…39204702229313495039
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:58,004,633 XPM·at block #6,845,025 · 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