Block #2,670,737

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/21/2018, 1:29:16 AM · Difficulty 11.6853 · 4,167,045 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0d43052c4e77944ca8e3c1087555ddbde67e04dc83c6d139b9468ce8518c97e5

Height

#2,670,737

Difficulty

11.685325

Transactions

4

Size

1.84 KB

Version

2

Bits

0baf7172

Nonce

1,350,608,087

Timestamp

5/21/2018, 1:29:16 AM

Confirmations

4,167,045

Merkle Root

2404c73a78fe7b4d968bc437a35ba987e387ab83b46e9957d4f80abbaa096101
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.

3.429 × 10⁹⁶(97-digit number)
34296600077738897969…75762230442958028799
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
3.429 × 10⁹⁶(97-digit number)
34296600077738897969…75762230442958028799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.859 × 10⁹⁶(97-digit number)
68593200155477795939…51524460885916057599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.371 × 10⁹⁷(98-digit number)
13718640031095559187…03048921771832115199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.743 × 10⁹⁷(98-digit number)
27437280062191118375…06097843543664230399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.487 × 10⁹⁷(98-digit number)
54874560124382236751…12195687087328460799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.097 × 10⁹⁸(99-digit number)
10974912024876447350…24391374174656921599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.194 × 10⁹⁸(99-digit number)
21949824049752894700…48782748349313843199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.389 × 10⁹⁸(99-digit number)
43899648099505789401…97565496698627686399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.779 × 10⁹⁸(99-digit number)
87799296199011578802…95130993397255372799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.755 × 10⁹⁹(100-digit number)
17559859239802315760…90261986794510745599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.511 × 10⁹⁹(100-digit number)
35119718479604631521…80523973589021491199
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,946,593 XPM·at block #6,837,781 · 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