Block #2,737,347

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/7/2018, 2:21:31 AM · Difficulty 11.6094 · 4,105,441 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e81af7df2f229310db3b106f0fea83b98f1602b177b9e393ac3d3d3b17314d57

Height

#2,737,347

Difficulty

11.609378

Transactions

5

Size

1.22 KB

Version

2

Bits

0b9c0033

Nonce

2,112,013,704

Timestamp

7/7/2018, 2:21:31 AM

Confirmations

4,105,441

Merkle Root

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

6.828 × 10⁹⁴(95-digit number)
68284723968262406312…90228658699244653119
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
6.828 × 10⁹⁴(95-digit number)
68284723968262406312…90228658699244653119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.365 × 10⁹⁵(96-digit number)
13656944793652481262…80457317398489306239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.731 × 10⁹⁵(96-digit number)
27313889587304962525…60914634796978612479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.462 × 10⁹⁵(96-digit number)
54627779174609925050…21829269593957224959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.092 × 10⁹⁶(97-digit number)
10925555834921985010…43658539187914449919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.185 × 10⁹⁶(97-digit number)
21851111669843970020…87317078375828899839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.370 × 10⁹⁶(97-digit number)
43702223339687940040…74634156751657799679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.740 × 10⁹⁶(97-digit number)
87404446679375880080…49268313503315599359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.748 × 10⁹⁷(98-digit number)
17480889335875176016…98536627006631198719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.496 × 10⁹⁷(98-digit number)
34961778671750352032…97073254013262397439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.992 × 10⁹⁷(98-digit number)
69923557343500704064…94146508026524794879
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,986,645 XPM·at block #6,842,787 · 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