Block #2,680,355

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/27/2018, 4:09:00 PM · Difficulty 11.6918 · 4,161,107 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ed1ef27b66d0b34adc3375e737c5b8d185b050feb290d14931cea57106251907

Height

#2,680,355

Difficulty

11.691763

Transactions

6

Size

1.57 KB

Version

2

Bits

0bb11764

Nonce

809,395,991

Timestamp

5/27/2018, 4:09:00 PM

Confirmations

4,161,107

Merkle Root

cbf498d1b586fd9ed8609c2d76624419415d97742a8321a848180ebdb6758549
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.745 × 10⁹⁴(95-digit number)
17453651192078235165…43975373299161689401
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.745 × 10⁹⁴(95-digit number)
17453651192078235165…43975373299161689401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.490 × 10⁹⁴(95-digit number)
34907302384156470330…87950746598323378801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.981 × 10⁹⁴(95-digit number)
69814604768312940661…75901493196646757601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.396 × 10⁹⁵(96-digit number)
13962920953662588132…51802986393293515201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.792 × 10⁹⁵(96-digit number)
27925841907325176264…03605972786587030401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.585 × 10⁹⁵(96-digit number)
55851683814650352529…07211945573174060801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.117 × 10⁹⁶(97-digit number)
11170336762930070505…14423891146348121601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.234 × 10⁹⁶(97-digit number)
22340673525860141011…28847782292696243201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.468 × 10⁹⁶(97-digit number)
44681347051720282023…57695564585392486401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.936 × 10⁹⁶(97-digit number)
89362694103440564046…15391129170784972801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.787 × 10⁹⁷(98-digit number)
17872538820688112809…30782258341569945601
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,976,069 XPM·at block #6,841,461 · 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