Block #3,505,077

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/8/2020, 8:53:47 AM · Difficulty 10.9307 · 3,336,785 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
06abbc427e3042c0c649fc750a3ad6fb5adc2dd4cab4043f43c3e5a562a8924d

Height

#3,505,077

Difficulty

10.930707

Transactions

16

Size

74.87 KB

Version

2

Bits

0aee42cf

Nonce

321,759,260

Timestamp

1/8/2020, 8:53:47 AM

Confirmations

3,336,785

Merkle Root

3e330dfab4d4ff81ff5df96f7572b35712c132bb2e604ed55bc159c56395fa77
Transactions (16)
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.

6.782 × 10⁹³(94-digit number)
67824857717148371292…80806853022778133001
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
6.782 × 10⁹³(94-digit number)
67824857717148371292…80806853022778133001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.356 × 10⁹⁴(95-digit number)
13564971543429674258…61613706045556266001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.712 × 10⁹⁴(95-digit number)
27129943086859348517…23227412091112532001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.425 × 10⁹⁴(95-digit number)
54259886173718697034…46454824182225064001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.085 × 10⁹⁵(96-digit number)
10851977234743739406…92909648364450128001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.170 × 10⁹⁵(96-digit number)
21703954469487478813…85819296728900256001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.340 × 10⁹⁵(96-digit number)
43407908938974957627…71638593457800512001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.681 × 10⁹⁵(96-digit number)
86815817877949915254…43277186915601024001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.736 × 10⁹⁶(97-digit number)
17363163575589983050…86554373831202048001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.472 × 10⁹⁶(97-digit number)
34726327151179966101…73108747662404096001
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,979,273 XPM·at block #6,841,861 · 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