Block #2,735,915

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/6/2018, 2:27:17 AM · Difficulty 11.6095 · 4,105,669 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7dbb92a80c2d6a7879ee6db321d39b6e5073282e83e56506c552921a9a4572ea

Height

#2,735,915

Difficulty

11.609538

Transactions

16

Size

4.22 KB

Version

2

Bits

0b9c0ab6

Nonce

1,980,722,436

Timestamp

7/6/2018, 2:27:17 AM

Confirmations

4,105,669

Merkle Root

3b0fb82fa94344ec9a2362b904539cbcbfbfc109e158767a52f1f171bea60d30
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.320 × 10⁹⁶(97-digit number)
13206750428492822423…75067486499115431681
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.320 × 10⁹⁶(97-digit number)
13206750428492822423…75067486499115431681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.641 × 10⁹⁶(97-digit number)
26413500856985644847…50134972998230863361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.282 × 10⁹⁶(97-digit number)
52827001713971289694…00269945996461726721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.056 × 10⁹⁷(98-digit number)
10565400342794257938…00539891992923453441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.113 × 10⁹⁷(98-digit number)
21130800685588515877…01079783985846906881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.226 × 10⁹⁷(98-digit number)
42261601371177031755…02159567971693813761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.452 × 10⁹⁷(98-digit number)
84523202742354063510…04319135943387627521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.690 × 10⁹⁸(99-digit number)
16904640548470812702…08638271886775255041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.380 × 10⁹⁸(99-digit number)
33809281096941625404…17276543773550510081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.761 × 10⁹⁸(99-digit number)
67618562193883250808…34553087547101020161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.352 × 10⁹⁹(100-digit number)
13523712438776650161…69106175094202040321
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,977,059 XPM·at block #6,841,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