Block #2,733,048

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/3/2018, 10:14:43 PM · Difficulty 11.6297 · 4,109,286 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
871c25d05960b21ec4203afda0bacc9589a166ae1aa1558bf38b65830cfad9d5

Height

#2,733,048

Difficulty

11.629650

Transactions

12

Size

3.69 KB

Version

2

Bits

0ba130c0

Nonce

1,735,808,597

Timestamp

7/3/2018, 10:14:43 PM

Confirmations

4,109,286

Merkle Root

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

1.702 × 10⁹⁶(97-digit number)
17022363691220963625…42584957021397347839
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
1.702 × 10⁹⁶(97-digit number)
17022363691220963625…42584957021397347839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.404 × 10⁹⁶(97-digit number)
34044727382441927250…85169914042794695679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.808 × 10⁹⁶(97-digit number)
68089454764883854501…70339828085589391359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.361 × 10⁹⁷(98-digit number)
13617890952976770900…40679656171178782719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.723 × 10⁹⁷(98-digit number)
27235781905953541800…81359312342357565439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.447 × 10⁹⁷(98-digit number)
54471563811907083601…62718624684715130879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.089 × 10⁹⁸(99-digit number)
10894312762381416720…25437249369430261759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.178 × 10⁹⁸(99-digit number)
21788625524762833440…50874498738860523519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.357 × 10⁹⁸(99-digit number)
43577251049525666881…01748997477721047039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.715 × 10⁹⁸(99-digit number)
87154502099051333762…03497994955442094079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.743 × 10⁹⁹(100-digit number)
17430900419810266752…06995989910884188159
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,983,078 XPM·at block #6,842,333 · 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