Block #3,082,724

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/7/2019, 4:36:49 PM · Difficulty 11.0246 · 3,758,578 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d25429b46e1483aea11135c113a6c6971bb0fcb1b223a8e98d5be9d9415da6b5

Height

#3,082,724

Difficulty

11.024638

Transactions

2

Size

574 B

Version

2

Bits

0b064eb1

Nonce

458,006,808

Timestamp

3/7/2019, 4:36:49 PM

Confirmations

3,758,578

Merkle Root

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

9.543 × 10⁹⁵(96-digit number)
95431527915228908789…75382038278264273039
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
9.543 × 10⁹⁵(96-digit number)
95431527915228908789…75382038278264273039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.908 × 10⁹⁶(97-digit number)
19086305583045781757…50764076556528546079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.817 × 10⁹⁶(97-digit number)
38172611166091563515…01528153113057092159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.634 × 10⁹⁶(97-digit number)
76345222332183127031…03056306226114184319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.526 × 10⁹⁷(98-digit number)
15269044466436625406…06112612452228368639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.053 × 10⁹⁷(98-digit number)
30538088932873250812…12225224904456737279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.107 × 10⁹⁷(98-digit number)
61076177865746501625…24450449808913474559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.221 × 10⁹⁸(99-digit number)
12215235573149300325…48900899617826949119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.443 × 10⁹⁸(99-digit number)
24430471146298600650…97801799235653898239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.886 × 10⁹⁸(99-digit number)
48860942292597201300…95603598471307796479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.772 × 10⁹⁸(99-digit number)
97721884585194402600…91207196942615592959
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,974,775 XPM·at block #6,841,301 · 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