Block #346,470

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/6/2014, 1:57:01 PM · Difficulty 10.2275 · 6,480,837 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
dad7aed31d922d8dfc9d8b7170da8f078192f9751887f0bb3acfa7ecb3313aa0

Height

#346,470

Difficulty

10.227493

Transactions

13

Size

3.99 KB

Version

2

Bits

0a3a3d00

Nonce

66,925

Timestamp

1/6/2014, 1:57:01 PM

Confirmations

6,480,837

Merkle Root

921795beb4fd3384345c07b46186d61e7f35f3c2acc8326dede6e9836dc10b2c
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.784 × 10⁹⁶(97-digit number)
17842791448346962739…87569089239081253761
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.784 × 10⁹⁶(97-digit number)
17842791448346962739…87569089239081253761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.568 × 10⁹⁶(97-digit number)
35685582896693925479…75138178478162507521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.137 × 10⁹⁶(97-digit number)
71371165793387850959…50276356956325015041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.427 × 10⁹⁷(98-digit number)
14274233158677570191…00552713912650030081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.854 × 10⁹⁷(98-digit number)
28548466317355140383…01105427825300060161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.709 × 10⁹⁷(98-digit number)
57096932634710280767…02210855650600120321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.141 × 10⁹⁸(99-digit number)
11419386526942056153…04421711301200240641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.283 × 10⁹⁸(99-digit number)
22838773053884112306…08843422602400481281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.567 × 10⁹⁸(99-digit number)
45677546107768224613…17686845204800962561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.135 × 10⁹⁸(99-digit number)
91355092215536449227…35373690409601925121
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,862,568 XPM·at block #6,827,306 · 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