Block #2,833,274

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/10/2018, 3:24:57 PM · Difficulty 11.7153 · 4,009,668 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b4d6038f069372f3ff9030b1edec3e346c42083a80bb93effa90a2161c8b5c9b

Height

#2,833,274

Difficulty

11.715271

Transactions

4

Size

1.62 KB

Version

2

Bits

0bb71bf8

Nonce

295,563,497

Timestamp

9/10/2018, 3:24:57 PM

Confirmations

4,009,668

Merkle Root

c87d8bffb797a4c5bffdfda69cb0cb60fcb89c3b1ef7cae214b3a740000ccfc8
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.

6.146 × 10⁹⁴(95-digit number)
61464027068171209354…33911848044213199201
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
6.146 × 10⁹⁴(95-digit number)
61464027068171209354…33911848044213199201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.229 × 10⁹⁵(96-digit number)
12292805413634241870…67823696088426398401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.458 × 10⁹⁵(96-digit number)
24585610827268483741…35647392176852796801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.917 × 10⁹⁵(96-digit number)
49171221654536967483…71294784353705593601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.834 × 10⁹⁵(96-digit number)
98342443309073934966…42589568707411187201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.966 × 10⁹⁶(97-digit number)
19668488661814786993…85179137414822374401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.933 × 10⁹⁶(97-digit number)
39336977323629573986…70358274829644748801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.867 × 10⁹⁶(97-digit number)
78673954647259147973…40716549659289497601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.573 × 10⁹⁷(98-digit number)
15734790929451829594…81433099318578995201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.146 × 10⁹⁷(98-digit number)
31469581858903659189…62866198637157990401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.293 × 10⁹⁷(98-digit number)
62939163717807318378…25732397274315980801
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,987,886 XPM·at block #6,842,941 · 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