Block #2,720,743

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/25/2018, 12:38:57 PM · Difficulty 11.6133 · 4,121,207 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
21743c8110d6b327fa6c7b84d2c23da861d453504d262091c5efb41040e2b85c

Height

#2,720,743

Difficulty

11.613338

Transactions

2

Size

575 B

Version

2

Bits

0b9d03b7

Nonce

300,842,981

Timestamp

6/25/2018, 12:38:57 PM

Confirmations

4,121,207

Merkle Root

b81cb43f6d73120b7b2abdc59486acb76cc4d5e0d299676ef4d66d350145a451
Transactions (2)
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.234 × 10⁹⁴(95-digit number)
32341483649657652335…97730438880767630719
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.234 × 10⁹⁴(95-digit number)
32341483649657652335…97730438880767630719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.468 × 10⁹⁴(95-digit number)
64682967299315304671…95460877761535261439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.293 × 10⁹⁵(96-digit number)
12936593459863060934…90921755523070522879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.587 × 10⁹⁵(96-digit number)
25873186919726121868…81843511046141045759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.174 × 10⁹⁵(96-digit number)
51746373839452243736…63687022092282091519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.034 × 10⁹⁶(97-digit number)
10349274767890448747…27374044184564183039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.069 × 10⁹⁶(97-digit number)
20698549535780897494…54748088369128366079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.139 × 10⁹⁶(97-digit number)
41397099071561794989…09496176738256732159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.279 × 10⁹⁶(97-digit number)
82794198143123589978…18992353476513464319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.655 × 10⁹⁷(98-digit number)
16558839628624717995…37984706953026928639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.311 × 10⁹⁷(98-digit number)
33117679257249435991…75969413906053857279
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,979,980 XPM·at block #6,841,949 · 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