Block #1,977,581

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/10/2017, 2:28:51 PM · Difficulty 10.7576 · 4,840,257 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
27c3b475728b98f5dd2bd42dc7c4db946c7e69fa128f8e73e98f4f0d0f8fd373

Height

#1,977,581

Difficulty

10.757612

Transactions

2

Size

722 B

Version

2

Bits

0ac1f2e0

Nonce

154,752,640

Timestamp

2/10/2017, 2:28:51 PM

Confirmations

4,840,257

Merkle Root

35eba3bd09635a077d10813ba875bbdf68f59ae8ab44f84a9d4aa0c8628426e6
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.

2.659 × 10⁹⁶(97-digit number)
26593213028032323832…15436731054816350719
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
2.659 × 10⁹⁶(97-digit number)
26593213028032323832…15436731054816350719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.318 × 10⁹⁶(97-digit number)
53186426056064647665…30873462109632701439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.063 × 10⁹⁷(98-digit number)
10637285211212929533…61746924219265402879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.127 × 10⁹⁷(98-digit number)
21274570422425859066…23493848438530805759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.254 × 10⁹⁷(98-digit number)
42549140844851718132…46987696877061611519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.509 × 10⁹⁷(98-digit number)
85098281689703436264…93975393754123223039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.701 × 10⁹⁸(99-digit number)
17019656337940687252…87950787508246446079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.403 × 10⁹⁸(99-digit number)
34039312675881374505…75901575016492892159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.807 × 10⁹⁸(99-digit number)
68078625351762749011…51803150032985784319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.361 × 10⁹⁹(100-digit number)
13615725070352549802…03606300065971568639
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,768 XPM·at block #6,817,837 · 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