Block #348,322

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/7/2014, 5:35:59 PM · Difficulty 10.2565 · 6,460,423 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b6fee8d23c1933c7c6fa71649607852f829f1132385f1d11db41a2663307a234

Height

#348,322

Difficulty

10.256496

Transactions

3

Size

1.27 KB

Version

2

Bits

0a41a9bb

Nonce

57,933

Timestamp

1/7/2014, 5:35:59 PM

Confirmations

6,460,423

Merkle Root

ef5b25810aa03e9c667d848a59149c433e86731cc9a0746cc951bfbc996b2843
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.140 × 10⁹⁷(98-digit number)
11402750635681698526…00588456100792690401
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.140 × 10⁹⁷(98-digit number)
11402750635681698526…00588456100792690401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.280 × 10⁹⁷(98-digit number)
22805501271363397052…01176912201585380801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.561 × 10⁹⁷(98-digit number)
45611002542726794104…02353824403170761601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.122 × 10⁹⁷(98-digit number)
91222005085453588209…04707648806341523201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.824 × 10⁹⁸(99-digit number)
18244401017090717641…09415297612683046401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.648 × 10⁹⁸(99-digit number)
36488802034181435283…18830595225366092801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.297 × 10⁹⁸(99-digit number)
72977604068362870567…37661190450732185601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.459 × 10⁹⁹(100-digit number)
14595520813672574113…75322380901464371201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.919 × 10⁹⁹(100-digit number)
29191041627345148227…50644761802928742401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.838 × 10⁹⁹(100-digit number)
58382083254690296454…01289523605857484801
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,714,008 XPM·at block #6,808,744 · 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