Block #2,732,003

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/3/2018, 4:27:02 AM · Difficulty 11.6312 · 4,111,009 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
22aedfeddfc478eb4b7a8103c3d004081288f46f850bf03a5a5045c0480308a3

Height

#2,732,003

Difficulty

11.631200

Transactions

31

Size

9.47 KB

Version

2

Bits

0ba19659

Nonce

2,083,696,373

Timestamp

7/3/2018, 4:27:02 AM

Confirmations

4,111,009

Merkle Root

4644b898881ede849bcb82ee004ed27dba8a7a4c3e861c0196c32d65d2bb079d
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.295 × 10⁹⁴(95-digit number)
22959383303538958159…65443863492617703361
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.295 × 10⁹⁴(95-digit number)
22959383303538958159…65443863492617703361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.591 × 10⁹⁴(95-digit number)
45918766607077916319…30887726985235406721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.183 × 10⁹⁴(95-digit number)
91837533214155832638…61775453970470813441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.836 × 10⁹⁵(96-digit number)
18367506642831166527…23550907940941626881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.673 × 10⁹⁵(96-digit number)
36735013285662333055…47101815881883253761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.347 × 10⁹⁵(96-digit number)
73470026571324666110…94203631763766507521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.469 × 10⁹⁶(97-digit number)
14694005314264933222…88407263527533015041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.938 × 10⁹⁶(97-digit number)
29388010628529866444…76814527055066030081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.877 × 10⁹⁶(97-digit number)
58776021257059732888…53629054110132060161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.175 × 10⁹⁷(98-digit number)
11755204251411946577…07258108220264120321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.351 × 10⁹⁷(98-digit number)
23510408502823893155…14516216440528240641
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,988,451 XPM·at block #6,843,011 · 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