Block #2,727,411

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/30/2018, 12:59:18 AM · Difficulty 11.6262 · 4,113,003 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0a619f3f21a96a3673b80951930cff3f9409517aaa9483f008f01594dcccd79c

Height

#2,727,411

Difficulty

11.626204

Transactions

2

Size

574 B

Version

2

Bits

0ba04eed

Nonce

1,853,866,413

Timestamp

6/30/2018, 12:59:18 AM

Confirmations

4,113,003

Merkle Root

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

5.654 × 10⁹³(94-digit number)
56547413111428672993…14607560566155734659
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
5.654 × 10⁹³(94-digit number)
56547413111428672993…14607560566155734659
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.130 × 10⁹⁴(95-digit number)
11309482622285734598…29215121132311469319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.261 × 10⁹⁴(95-digit number)
22618965244571469197…58430242264622938639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.523 × 10⁹⁴(95-digit number)
45237930489142938394…16860484529245877279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.047 × 10⁹⁴(95-digit number)
90475860978285876789…33720969058491754559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.809 × 10⁹⁵(96-digit number)
18095172195657175357…67441938116983509119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.619 × 10⁹⁵(96-digit number)
36190344391314350715…34883876233967018239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.238 × 10⁹⁵(96-digit number)
72380688782628701431…69767752467934036479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.447 × 10⁹⁶(97-digit number)
14476137756525740286…39535504935868072959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.895 × 10⁹⁶(97-digit number)
28952275513051480572…79071009871736145919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.790 × 10⁹⁶(97-digit number)
57904551026102961145…58142019743472291839
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,967,636 XPM·at block #6,840,413 · 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