Block #342,196

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/3/2014, 10:21:01 PM · Difficulty 10.1529 · 6,468,250 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
84fe85f40db9d178e5bd4fe67da65709d7898c59beea618a84fb67bf4cf87a76

Height

#342,196

Difficulty

10.152919

Transactions

8

Size

3.13 KB

Version

2

Bits

0a2725b8

Nonce

29,314

Timestamp

1/3/2014, 10:21:01 PM

Confirmations

6,468,250

Merkle Root

53a87843d81b61133a5540096f8f80a517ecd6feaf91eec3f798db4520f788b4
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.

2.039 × 10⁹⁶(97-digit number)
20397683034646822499…21610921536537510401
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
2.039 × 10⁹⁶(97-digit number)
20397683034646822499…21610921536537510401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.079 × 10⁹⁶(97-digit number)
40795366069293644998…43221843073075020801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.159 × 10⁹⁶(97-digit number)
81590732138587289996…86443686146150041601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.631 × 10⁹⁷(98-digit number)
16318146427717457999…72887372292300083201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.263 × 10⁹⁷(98-digit number)
32636292855434915998…45774744584600166401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.527 × 10⁹⁷(98-digit number)
65272585710869831997…91549489169200332801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.305 × 10⁹⁸(99-digit number)
13054517142173966399…83098978338400665601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.610 × 10⁹⁸(99-digit number)
26109034284347932798…66197956676801331201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.221 × 10⁹⁸(99-digit number)
52218068568695865597…32395913353602662401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.044 × 10⁹⁹(100-digit number)
10443613713739173119…64791826707205324801
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,727,653 XPM·at block #6,810,445 · 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