Block #2,761,180

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/23/2018, 5:42:39 AM · Difficulty 11.6534 · 4,081,771 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5c09ab8e5303f00c4f42467be1999c1b8185b0eebc829f05a7f3b71b3efe438d

Height

#2,761,180

Difficulty

11.653449

Transactions

4

Size

75.21 KB

Version

2

Bits

0ba7486f

Nonce

1,919,387,509

Timestamp

7/23/2018, 5:42:39 AM

Confirmations

4,081,771

Merkle Root

86e99c165e201047d773d22b3c349bfbac286ae9eb9360667f4acebabba6c5fc
Transactions (4)
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.

2.022 × 10⁹⁷(98-digit number)
20222339461107096370…09286623561472967679
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
2.022 × 10⁹⁷(98-digit number)
20222339461107096370…09286623561472967679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.044 × 10⁹⁷(98-digit number)
40444678922214192741…18573247122945935359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.088 × 10⁹⁷(98-digit number)
80889357844428385483…37146494245891870719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.617 × 10⁹⁸(99-digit number)
16177871568885677096…74292988491783741439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.235 × 10⁹⁸(99-digit number)
32355743137771354193…48585976983567482879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.471 × 10⁹⁸(99-digit number)
64711486275542708386…97171953967134965759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.294 × 10⁹⁹(100-digit number)
12942297255108541677…94343907934269931519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.588 × 10⁹⁹(100-digit number)
25884594510217083354…88687815868539863039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.176 × 10⁹⁹(100-digit number)
51769189020434166709…77375631737079726079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.035 × 10¹⁰⁰(101-digit number)
10353837804086833341…54751263474159452159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.070 × 10¹⁰⁰(101-digit number)
20707675608173666683…09502526948318904319
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,987,960 XPM·at block #6,842,950 · 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