Block #3,082,668

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/7/2019, 3:49:51 PM · Difficulty 11.0229 · 3,758,468 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6b3c9e3a7fa29c848b88b3bdbec2530551c9fbb7c37f3d651fadb96db32f72c4

Height

#3,082,668

Difficulty

11.022874

Transactions

2

Size

1.14 KB

Version

2

Bits

0b05db0d

Nonce

189,208,159

Timestamp

3/7/2019, 3:49:51 PM

Confirmations

3,758,468

Merkle Root

86044749afe0e47c71d05845731346c194764450df3427932b0d9b3f21ba43e2
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.213 × 10⁹⁵(96-digit number)
22137016399575280885…18822326317678274399
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.213 × 10⁹⁵(96-digit number)
22137016399575280885…18822326317678274399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.427 × 10⁹⁵(96-digit number)
44274032799150561770…37644652635356548799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.854 × 10⁹⁵(96-digit number)
88548065598301123540…75289305270713097599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.770 × 10⁹⁶(97-digit number)
17709613119660224708…50578610541426195199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.541 × 10⁹⁶(97-digit number)
35419226239320449416…01157221082852390399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.083 × 10⁹⁶(97-digit number)
70838452478640898832…02314442165704780799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.416 × 10⁹⁷(98-digit number)
14167690495728179766…04628884331409561599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.833 × 10⁹⁷(98-digit number)
28335380991456359533…09257768662819123199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.667 × 10⁹⁷(98-digit number)
56670761982912719066…18515537325638246399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.133 × 10⁹⁸(99-digit number)
11334152396582543813…37031074651276492799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.266 × 10⁹⁸(99-digit number)
22668304793165087626…74062149302552985599
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,973,450 XPM·at block #6,841,135 · 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