1. #6,810,0722CC11 primes

    Cunningham 2nd · ⛏️ coinsforall.io

Block #345,403

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/5/2014, 10:05:52 PM · Difficulty 10.2090 · 6,464,670 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
58dadd7cf4e641f70207d52b911ecbcd6bcf976aae075796829b70094b12f536

Height

#345,403

Difficulty

10.209018

Transactions

4

Size

3.29 KB

Version

2

Bits

0a35822d

Nonce

3,509

Timestamp

1/5/2014, 10:05:52 PM

Confirmations

6,464,670

Merkle Root

beefae4095c07c83f844a878529bb9b0b5e592e03463017c749ad895cba01276
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.144 × 10⁹⁵(96-digit number)
11441402330986275872…53225270481610962271
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.144 × 10⁹⁵(96-digit number)
11441402330986275872…53225270481610962271
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.288 × 10⁹⁵(96-digit number)
22882804661972551744…06450540963221924541
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.576 × 10⁹⁵(96-digit number)
45765609323945103489…12901081926443849081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.153 × 10⁹⁵(96-digit number)
91531218647890206979…25802163852887698161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.830 × 10⁹⁶(97-digit number)
18306243729578041395…51604327705775396321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.661 × 10⁹⁶(97-digit number)
36612487459156082791…03208655411550792641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.322 × 10⁹⁶(97-digit number)
73224974918312165583…06417310823101585281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.464 × 10⁹⁷(98-digit number)
14644994983662433116…12834621646203170561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.928 × 10⁹⁷(98-digit number)
29289989967324866233…25669243292406341121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.857 × 10⁹⁷(98-digit number)
58579979934649732466…51338486584812682241
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,724,657 XPM·at block #6,810,072 · 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.

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