Block #2,132,114

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/25/2017, 1:58:28 PM · Difficulty 10.9102 · 4,712,389 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f7b1eb8fe8eab240cf3a467b9aaa84cedee4f8df75010984fc8768c4dcc68897

Height

#2,132,114

Difficulty

10.910159

Transactions

4

Size

2.45 KB

Version

2

Bits

0ae90031

Nonce

526,778,123

Timestamp

5/25/2017, 1:58:28 PM

Confirmations

4,712,389

Merkle Root

bdfa9bf61ecdf7debf1e6325b08ee382de932d1c9b25635d051a8b37e1b334bf
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.873 × 10⁹⁴(95-digit number)
18734876551184918121…75721654343052785119
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.873 × 10⁹⁴(95-digit number)
18734876551184918121…75721654343052785119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.746 × 10⁹⁴(95-digit number)
37469753102369836243…51443308686105570239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.493 × 10⁹⁴(95-digit number)
74939506204739672487…02886617372211140479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.498 × 10⁹⁵(96-digit number)
14987901240947934497…05773234744422280959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.997 × 10⁹⁵(96-digit number)
29975802481895868995…11546469488844561919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.995 × 10⁹⁵(96-digit number)
59951604963791737990…23092938977689123839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.199 × 10⁹⁶(97-digit number)
11990320992758347598…46185877955378247679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.398 × 10⁹⁶(97-digit number)
23980641985516695196…92371755910756495359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.796 × 10⁹⁶(97-digit number)
47961283971033390392…84743511821512990719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.592 × 10⁹⁶(97-digit number)
95922567942066780784…69487023643025981439
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,000,422 XPM·at block #6,844,502 · 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