Block #2,271,875

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/28/2017, 12:52:59 PM · Difficulty 10.9540 · 4,560,522 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
da953e2d2a7dc4f7f19d94e556e95c2cffaa290921a9d21097be393059f1dbd2

Height

#2,271,875

Difficulty

10.953994

Transactions

3

Size

1.22 KB

Version

2

Bits

0af438f7

Nonce

1,459,003,962

Timestamp

8/28/2017, 12:52:59 PM

Confirmations

4,560,522

Merkle Root

e2f25eded4e745a2da5a9cc69317dfc2c596502409f7f3882c60a20fed949ef0
Transactions (3)
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.162 × 10⁹⁶(97-digit number)
11625078569835731756…35630903849714974721
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.162 × 10⁹⁶(97-digit number)
11625078569835731756…35630903849714974721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.325 × 10⁹⁶(97-digit number)
23250157139671463512…71261807699429949441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.650 × 10⁹⁶(97-digit number)
46500314279342927025…42523615398859898881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.300 × 10⁹⁶(97-digit number)
93000628558685854051…85047230797719797761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.860 × 10⁹⁷(98-digit number)
18600125711737170810…70094461595439595521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.720 × 10⁹⁷(98-digit number)
37200251423474341620…40188923190879191041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.440 × 10⁹⁷(98-digit number)
74400502846948683240…80377846381758382081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.488 × 10⁹⁸(99-digit number)
14880100569389736648…60755692763516764161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.976 × 10⁹⁸(99-digit number)
29760201138779473296…21511385527033528321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.952 × 10⁹⁸(99-digit number)
59520402277558946592…43022771054067056641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.190 × 10⁹⁹(100-digit number)
11904080455511789318…86045542108134113281
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,903,319 XPM·at block #6,832,396 · 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