Block #3,054,179

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/15/2019, 4:57:05 PM · Difficulty 11.0028 · 3,788,579 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
512e408fa554f766f4f8b159bc9bb2a98745e5676d420b6e0d1f873de5c571b2

Height

#3,054,179

Difficulty

11.002781

Transactions

2

Size

904 B

Version

2

Bits

0b00b63b

Nonce

1,286,867,743

Timestamp

2/15/2019, 4:57:05 PM

Confirmations

3,788,579

Merkle Root

a1604d2bfec31a9dddf88e4a1ff15885bd2b0b6fe7b4e9ce45fc0d3042f8a4a0
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.734 × 10⁹¹(92-digit number)
37347673136875155344…42482291291576668321
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.734 × 10⁹¹(92-digit number)
37347673136875155344…42482291291576668321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.469 × 10⁹¹(92-digit number)
74695346273750310688…84964582583153336641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.493 × 10⁹²(93-digit number)
14939069254750062137…69929165166306673281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.987 × 10⁹²(93-digit number)
29878138509500124275…39858330332613346561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.975 × 10⁹²(93-digit number)
59756277019000248551…79716660665226693121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.195 × 10⁹³(94-digit number)
11951255403800049710…59433321330453386241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.390 × 10⁹³(94-digit number)
23902510807600099420…18866642660906772481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.780 × 10⁹³(94-digit number)
47805021615200198840…37733285321813544961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.561 × 10⁹³(94-digit number)
95610043230400397681…75466570643627089921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.912 × 10⁹⁴(95-digit number)
19122008646080079536…50933141287254179841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.824 × 10⁹⁴(95-digit number)
38244017292160159072…01866282574508359681
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,986,401 XPM·at block #6,842,757 · 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