Block #2,756,902

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/20/2018, 3:25:50 AM · Difficulty 11.6655 · 4,082,859 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
32166f73cec1f66b969a5d5ec3d1c34e1a35f2abcd76ea6786d37fb321d099f0

Height

#2,756,902

Difficulty

11.665493

Transactions

7

Size

1.85 KB

Version

2

Bits

0baa5dc4

Nonce

502,995,065

Timestamp

7/20/2018, 3:25:50 AM

Confirmations

4,082,859

Merkle Root

75f62c3dba570598ddfd12f9197710c163d084696a10c43b7bd2b450ff10a088
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.667 × 10⁹⁵(96-digit number)
16675743643906439763…37212504073205792001
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.667 × 10⁹⁵(96-digit number)
16675743643906439763…37212504073205792001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.335 × 10⁹⁵(96-digit number)
33351487287812879527…74425008146411584001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.670 × 10⁹⁵(96-digit number)
66702974575625759054…48850016292823168001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.334 × 10⁹⁶(97-digit number)
13340594915125151810…97700032585646336001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.668 × 10⁹⁶(97-digit number)
26681189830250303621…95400065171292672001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.336 × 10⁹⁶(97-digit number)
53362379660500607243…90800130342585344001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.067 × 10⁹⁷(98-digit number)
10672475932100121448…81600260685170688001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.134 × 10⁹⁷(98-digit number)
21344951864200242897…63200521370341376001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.268 × 10⁹⁷(98-digit number)
42689903728400485795…26401042740682752001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.537 × 10⁹⁷(98-digit number)
85379807456800971590…52802085481365504001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.707 × 10⁹⁸(99-digit number)
17075961491360194318…05604170962731008001
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,962,376 XPM·at block #6,839,760 · 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