Block #2,834,214

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/11/2018, 7:08:32 AM · Difficulty 11.7152 · 3,998,950 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0a7ab497e0fbc2d82343096746d5cbad638adb8e49b1adb34d2cf4290d5e6f0a

Height

#2,834,214

Difficulty

11.715161

Transactions

2

Size

1018 B

Version

2

Bits

0bb714c5

Nonce

1,686,029,864

Timestamp

9/11/2018, 7:08:32 AM

Confirmations

3,998,950

Merkle Root

23c8ac6b4bb875cfac2b98e13ef016b05a6805f6142256b14c8c926ac4069689
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.

8.340 × 10⁹³(94-digit number)
83401802569662394419…80799898257203867401
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
8.340 × 10⁹³(94-digit number)
83401802569662394419…80799898257203867401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.668 × 10⁹⁴(95-digit number)
16680360513932478883…61599796514407734801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.336 × 10⁹⁴(95-digit number)
33360721027864957767…23199593028815469601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.672 × 10⁹⁴(95-digit number)
66721442055729915535…46399186057630939201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.334 × 10⁹⁵(96-digit number)
13344288411145983107…92798372115261878401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.668 × 10⁹⁵(96-digit number)
26688576822291966214…85596744230523756801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.337 × 10⁹⁵(96-digit number)
53377153644583932428…71193488461047513601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.067 × 10⁹⁶(97-digit number)
10675430728916786485…42386976922095027201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.135 × 10⁹⁶(97-digit number)
21350861457833572971…84773953844190054401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.270 × 10⁹⁶(97-digit number)
42701722915667145942…69547907688380108801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.540 × 10⁹⁶(97-digit number)
85403445831334291885…39095815376760217601
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,909,492 XPM·at block #6,833,163 · 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