Block #2,744,571

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/11/2018, 6:52:41 PM · Difficulty 11.6448 · 4,088,889 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d1977cf12a378a12b4e141d2308df5a67dd08d6d4dc5cef47a4b585a1762b8e7

Height

#2,744,571

Difficulty

11.644776

Transactions

6

Size

2.36 KB

Version

2

Bits

0ba5100b

Nonce

428,824,975

Timestamp

7/11/2018, 6:52:41 PM

Confirmations

4,088,889

Merkle Root

e3a61740ac01fefdae59a54f697874ab57e3a293131777b47cc58a7dfc517d29
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.

7.643 × 10⁹⁶(97-digit number)
76430277802569406300…27019667510789652479
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
7.643 × 10⁹⁶(97-digit number)
76430277802569406300…27019667510789652479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.528 × 10⁹⁷(98-digit number)
15286055560513881260…54039335021579304959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.057 × 10⁹⁷(98-digit number)
30572111121027762520…08078670043158609919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.114 × 10⁹⁷(98-digit number)
61144222242055525040…16157340086317219839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.222 × 10⁹⁸(99-digit number)
12228844448411105008…32314680172634439679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.445 × 10⁹⁸(99-digit number)
24457688896822210016…64629360345268879359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.891 × 10⁹⁸(99-digit number)
48915377793644420032…29258720690537758719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.783 × 10⁹⁸(99-digit number)
97830755587288840064…58517441381075517439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.956 × 10⁹⁹(100-digit number)
19566151117457768012…17034882762151034879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.913 × 10⁹⁹(100-digit number)
39132302234915536025…34069765524302069759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.826 × 10⁹⁹(100-digit number)
78264604469831072051…68139531048604139519
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,911,880 XPM·at block #6,833,459 · 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