Block #3,558,370

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/15/2020, 6:41:38 AM · Difficulty 10.9126 · 3,268,367 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
dd05b312e5442180ec373372a822e9426efbc138efb985a1ec3abc46fe59bd0d

Height

#3,558,370

Difficulty

10.912573

Transactions

2

Size

541 B

Version

2

Bits

0ae99e5f

Nonce

2,056,561,465

Timestamp

2/15/2020, 6:41:38 AM

Confirmations

3,268,367

Merkle Root

f031af00f8169f3affec2584c998ee93901614d713a49037be426e5bf5e8d0e0
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.764 × 10⁹⁶(97-digit number)
57646860894547983412…72893025590975267839
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.764 × 10⁹⁶(97-digit number)
57646860894547983412…72893025590975267839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.152 × 10⁹⁷(98-digit number)
11529372178909596682…45786051181950535679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.305 × 10⁹⁷(98-digit number)
23058744357819193364…91572102363901071359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.611 × 10⁹⁷(98-digit number)
46117488715638386729…83144204727802142719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.223 × 10⁹⁷(98-digit number)
92234977431276773459…66288409455604285439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.844 × 10⁹⁸(99-digit number)
18446995486255354691…32576818911208570879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.689 × 10⁹⁸(99-digit number)
36893990972510709383…65153637822417141759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.378 × 10⁹⁸(99-digit number)
73787981945021418767…30307275644834283519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.475 × 10⁹⁹(100-digit number)
14757596389004283753…60614551289668567039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.951 × 10⁹⁹(100-digit number)
29515192778008567506…21229102579337134079
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 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
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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,858,051 XPM·at block #6,826,736 · 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