Block #2,883,783

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/16/2018, 4:21:54 PM · Difficulty 11.6272 · 3,958,072 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d13f2bf68a05343607609d55900f198d562196dafc9073cc5b634ba7dfcdabd2

Height

#2,883,783

Difficulty

11.627220

Transactions

2

Size

1.13 KB

Version

2

Bits

0ba0917f

Nonce

488,193,721

Timestamp

10/16/2018, 4:21:54 PM

Confirmations

3,958,072

Merkle Root

99ea99c597bf4da28a85fdf837c40fc6d54ec1a5329277ba248aed6473f6d567
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.

6.023 × 10⁹²(93-digit number)
60231101519600912644…77264213283295932641
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.023 × 10⁹²(93-digit number)
60231101519600912644…77264213283295932641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.204 × 10⁹³(94-digit number)
12046220303920182528…54528426566591865281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.409 × 10⁹³(94-digit number)
24092440607840365057…09056853133183730561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.818 × 10⁹³(94-digit number)
48184881215680730115…18113706266367461121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.636 × 10⁹³(94-digit number)
96369762431361460230…36227412532734922241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.927 × 10⁹⁴(95-digit number)
19273952486272292046…72454825065469844481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.854 × 10⁹⁴(95-digit number)
38547904972544584092…44909650130939688961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.709 × 10⁹⁴(95-digit number)
77095809945089168184…89819300261879377921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.541 × 10⁹⁵(96-digit number)
15419161989017833636…79638600523758755841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.083 × 10⁹⁵(96-digit number)
30838323978035667273…59277201047517511681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.167 × 10⁹⁵(96-digit number)
61676647956071334547…18554402095035023361
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,979,216 XPM·at block #6,841,854 · 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