Block #2,735,101

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/5/2018, 11:35:00 AM · Difficulty 11.6155 · 4,109,759 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3c2f4c67d31d9b4560b4de60e6f4de942596fb117f7dcd57832a53221d909829

Height

#2,735,101

Difficulty

11.615480

Transactions

4

Size

1.34 KB

Version

2

Bits

0b9d9015

Nonce

553,531,880

Timestamp

7/5/2018, 11:35:00 AM

Confirmations

4,109,759

Merkle Root

2be3ecccd15feee98a278432d878171dea7a561a82ee98d556e74ba8e08e0df1
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.072 × 10⁹⁵(96-digit number)
20727656792263031888…26355734477559386239
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.072 × 10⁹⁵(96-digit number)
20727656792263031888…26355734477559386239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.145 × 10⁹⁵(96-digit number)
41455313584526063777…52711468955118772479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.291 × 10⁹⁵(96-digit number)
82910627169052127555…05422937910237544959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.658 × 10⁹⁶(97-digit number)
16582125433810425511…10845875820475089919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.316 × 10⁹⁶(97-digit number)
33164250867620851022…21691751640950179839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.632 × 10⁹⁶(97-digit number)
66328501735241702044…43383503281900359679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.326 × 10⁹⁷(98-digit number)
13265700347048340408…86767006563800719359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.653 × 10⁹⁷(98-digit number)
26531400694096680817…73534013127601438719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.306 × 10⁹⁷(98-digit number)
53062801388193361635…47068026255202877439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.061 × 10⁹⁸(99-digit number)
10612560277638672327…94136052510405754879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.122 × 10⁹⁸(99-digit number)
21225120555277344654…88272105020811509759
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:58,003,292 XPM·at block #6,844,859 · 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