Block #2,646,955

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/3/2018, 3:29:01 PM · Difficulty 11.7561 · 4,185,629 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f76ada9b4057a6020eb51ad2a54c4539fc342f3107464c65a680ec942dea39f4

Height

#2,646,955

Difficulty

11.756074

Transactions

11

Size

4.53 KB

Version

2

Bits

0bc18e13

Nonce

291,461,492

Timestamp

5/3/2018, 3:29:01 PM

Confirmations

4,185,629

Merkle Root

b06658093f0cd60a94bacac2aefa75450b63cf15927bcfa06ad89206e6772913
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.

6.616 × 10⁹⁴(95-digit number)
66165242474597751360…30968514363909502081
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
6.616 × 10⁹⁴(95-digit number)
66165242474597751360…30968514363909502081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.323 × 10⁹⁵(96-digit number)
13233048494919550272…61937028727819004161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.646 × 10⁹⁵(96-digit number)
26466096989839100544…23874057455638008321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.293 × 10⁹⁵(96-digit number)
52932193979678201088…47748114911276016641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.058 × 10⁹⁶(97-digit number)
10586438795935640217…95496229822552033281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.117 × 10⁹⁶(97-digit number)
21172877591871280435…90992459645104066561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.234 × 10⁹⁶(97-digit number)
42345755183742560870…81984919290208133121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.469 × 10⁹⁶(97-digit number)
84691510367485121741…63969838580416266241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.693 × 10⁹⁷(98-digit number)
16938302073497024348…27939677160832532481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.387 × 10⁹⁷(98-digit number)
33876604146994048696…55879354321665064961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.775 × 10⁹⁷(98-digit number)
67753208293988097393…11758708643330129921
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,904,820 XPM·at block #6,832,583 · 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