Block #2,726,815

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/29/2018, 2:55:17 PM · Difficulty 11.6268 · 4,116,680 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
65b19985f3371ec5dad65ad1c26aa55838c4a74c09737da742a917cd25629642

Height

#2,726,815

Difficulty

11.626827

Transactions

11

Size

2.54 KB

Version

2

Bits

0ba077c1

Nonce

545,705,883

Timestamp

6/29/2018, 2:55:17 PM

Confirmations

4,116,680

Merkle Root

7fa2f63a5474fefa89b9eb8b48f53770e50ec8db6cf2d4c29ac549e0d613fd7b
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.475 × 10⁹⁴(95-digit number)
14759286596250189363…27214067767406184679
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.475 × 10⁹⁴(95-digit number)
14759286596250189363…27214067767406184679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.951 × 10⁹⁴(95-digit number)
29518573192500378727…54428135534812369359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.903 × 10⁹⁴(95-digit number)
59037146385000757454…08856271069624738719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.180 × 10⁹⁵(96-digit number)
11807429277000151490…17712542139249477439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.361 × 10⁹⁵(96-digit number)
23614858554000302981…35425084278498954879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.722 × 10⁹⁵(96-digit number)
47229717108000605963…70850168556997909759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.445 × 10⁹⁵(96-digit number)
94459434216001211927…41700337113995819519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.889 × 10⁹⁶(97-digit number)
18891886843200242385…83400674227991639039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.778 × 10⁹⁶(97-digit number)
37783773686400484770…66801348455983278079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.556 × 10⁹⁶(97-digit number)
75567547372800969541…33602696911966556159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.511 × 10⁹⁷(98-digit number)
15113509474560193908…67205393823933112319
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,992,332 XPM·at block #6,843,494 · 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