w8 · tx · HN8···3rm

tx · HN8DqWSaAoiNUMTQJscfLobycJ4ptsjxwtNPy2Tzw3rm

3N78mWnEqz1PUDVJjBgoyivJpitqpxwVAgH:  -0.01400000 Waves

2019.09.16 20:23 [679076] smart account 3N78mWnEqz1PUDVJjBgoyivJpitqpxwVAgH > SELF 0.00000000 Waves

{
    "type": 13,
    "id": "HN8DqWSaAoiNUMTQJscfLobycJ4ptsjxwtNPy2Tzw3rm",
    "fee": 1400000,
    "feeAssetId": null,
    "timestamp": 1568654563996,
    "version": 1,
    "sender": "3N78mWnEqz1PUDVJjBgoyivJpitqpxwVAgH",
    "senderPublicKey": "88re7tFwGU4jjye6Kxg3U4cKzYz7FooSWnqP2NNMfRt5",
    "proofs": [
        "4ypbDqJPxHi3mUSSVYD371axAZnQM8hVHYeV5LyqZGmRtMh2JhmPf55rFGaBcBaKXTWi51ko3nTsnKZuRJE7NaVA"
    ],
    "script": "base64:AAIDAAAAAAAAAAAAAAAFAAAAAAdxMXN0YXJ0AAAAAAAAAAC+AAAAAAdxMnN0YXJ0AAAAAAAAAAC+AAAAAAFzAAAAAAAAAAAKAQAAAARjb2VmAAAAAgAAAAFxAAAAA2RpZgkAAGkAAAACCQAAaAAAAAIFAAAAAXEJAABkAAAAAgkAAGgAAAACCQAAaAAAAAIA/////////9EFAAAAA2RpZgUAAAADZGlmAAAAAAAAACcQAAAAAAAAACcQAQAAAAthbm90aGVyY29lZgAAAAEAAAABcQQAAAADdmlnAAAAAAAAAAA0CQAAbAAAAAYJAABlAAAAAgkAAGQAAAACBQAAAAN2aWcAAAAAAAAAA+gJAABpAAAAAgAAAAAAAAGGoAUAAAABcQAAAAAAAAAAAAD//////////wAAAAAAAAAAAAAAAAAAAAAABQUAAAAERE9XTgAAAAEAAAAKY29udGV4dE9iagEAAAADYmV0AAAAAQAAAAVldmVudAQAAAABbgkBAAAAEUBleHRyTmF0aXZlKDEwNTApAAAAAgUAAAAEdGhpcwIAAAABbgQAAAABbQkBAAAAEUBleHRyTmF0aXZlKDEwNTApAAAAAgUAAAAEdGhpcwIAAAABbQQAAAAFY291bnQJAQAAABFAZXh0ck5hdGl2ZSgxMDUwKQAAAAIFAAAABHRoaXMCAAAABWNvdW50BAAAAANkaWYJAABlAAAAAgUAAAABbgUAAAABbQMJAAAAAAAAAgUAAAAFZXZlbnQAAAAAAAAAAAEDCQAAZgAAAAIAAAAAAAAAAGQJAQAAAARjb2VmAAAAAgUAAAAHcTFzdGFydAkAAGUAAAACCQAAZAAAAAIFAAAAAW4AAAAAAAAAAAEFAAAAAW0JAAACAAAAAQIAAAALdG8gbG93IGNvZWYEAAAABG5OZXcJAABkAAAAAgUAAAABbgAAAAAAAAAAAQQAAAAIY291bnROZXcJAABkAAAAAgUAAAAFY291bnQAAAAAAAAAAAEJAQAAAAhXcml0ZVNldAAAAAEJAARMAAAAAgkBAAAACURhdGFFbnRyeQAAAAIJAAEsAAAAAgkAAaQAAAABBQAAAAhjb3VudE5ldwIAAAAGX2V2ZW50BQAAAAVldmVudAkABEwAAAACCQEAAAAJRGF0YUVudHJ5AAAAAgkAASwAAAACCQABpAAAAAEFAAAACGNvdW50TmV3AgAAAAZfcW9lZjEJAQAAAARjb2VmAAAAAgUAAAAHcTFzdGFydAkAAGUAAAACBQAAAAFuBQAAAAFtCQAETAAAAAIJAQAAAAlEYXRhRW50cnkAAAACCQABLAAAAAIJAAGkAAAAAQUAAAAIY291bnROZXcCAAAABl9xb2VmMgkBAAAAC2Fub3RoZXJjb2VmAAAAAQkBAAAABGNvZWYAAAACBQAAAAdxMXN0YXJ0CQAAZQAAAAIFAAAAAW4FAAAAAW0JAARMAAAAAgkBAAAACURhdGFFbnRyeQAAAAICAAAAB3ExX25leHQJAQAAAARjb2VmAAAAAgUAAAAHcTFzdGFydAkAAGUAAAACCQAAZAAAAAIFAAAAAW4AAAAAAAAAAAEFAAAAAW0JAARMAAAAAgkBAAAACURhdGFFbnRyeQAAAAICAAAAB3EyX25leHQJAQAAAAthbm90aGVyY29lZgAAAAEJAQAAAARjb2VmAAAAAgUAAAAHcTFzdGFydAkAAGUAAAACCQAAZAAAAAIFAAAAAW4AAAAAAAAAAAEFAAAAAW0JAARMAAAAAgkBAAAACURhdGFFbnRyeQAAAAICAAAAAW4FAAAABG5OZXcJAARMAAAAAgkBAAAACURhdGFFbnRyeQAAAAICAAAABWNvdW50BQAAAAhjb3VudE5ldwUAAAADbmlsAwkAAGYAAAACAAAAAAAAAABkCQEAAAALYW5vdGhlcmNvZWYAAAABCQEAAAAEY29lZgAAAAIFAAAAB3Exc3RhcnQJAABkAAAAAgkAAGUAAAACBQAAAAFtBQAAAAFuAAAAAAAAAAABCQAAAgAAAAECAAAAC3RvIGxvdyBjb2VmBAAAAARtTmV3CQAAZAAAAAIFAAAAAW0AAAAAAAAAAAEEAAAACGNvdW50TmV3CQAAZAAAAAIFAAAABWNvdW50AAAAAAAAAAABCQEAAAAIV3JpdGVTZXQAAAABCQAETAAAAAIJAQAAAAlEYXRhRW50cnkAAAACCQABLAAAAAIJAAGkAAAAAQUAAAAIY291bnROZXcCAAAABl9ldmVudAUAAAAFZXZlbnQJAARMAAAAAgkBAAAACURhdGFFbnRyeQAAAAIJAAEsAAAAAgkAAaQAAAABBQAAAAhjb3VudE5ldwIAAAAGX3FvZWYyCQEAAAALYW5vdGhlcmNvZWYAAAABCQEAAAAEY29lZgAAAAIFAAAAB3Exc3RhcnQJAABlAAAAAgUAAAABbgUAAAABbQkABEwAAAACCQEAAAAJRGF0YUVudHJ5AAAAAgIAAAAHcTFfbmV4dAkBAAAABGNvZWYAAAACBQAAAAdxMXN0YXJ0CQAAZQAAAAIJAABlAAAAAgUAAAABbgAAAAAAAAAAAQUAAAABbQkABEwAAAACCQEAAAAJRGF0YUVudHJ5AAAAAgIAAAAHcTJfbmV4dAkBAAAAC2Fub3RoZXJjb2VmAAAAAQkBAAAABGNvZWYAAAACBQAAAAdxMXN0YXJ0CQAAZQAAAAIJAABlAAAAAgUAAAABbgAAAAAAAAAAAQUAAAABbQkABEwAAAACCQEAAAAJRGF0YUVudHJ5AAAAAgkAASwAAAACCQABpAAAAAEFAAAACGNvdW50TmV3AgAAAAZfcW9lZjEJAQAAAARjb2VmAAAAAgUAAAAHcTFzdGFydAkAAGUAAAACBQAAAAFuBQAAAAFtCQAETAAAAAIJAQAAAAlEYXRhRW50cnkAAAACAgAAAAFtBQAAAARtTmV3CQAETAAAAAIJAQAAAAlEYXRhRW50cnkAAAACAgAAAAVjb3VudAUAAAAIY291bnROZXcFAAAAA25pbAAAAAEAAAAKY29udGV4dE9iagEAAAAGdmVyaWZ5AAAAAAaN+nAo",
    "chainId": 84,
    "height": 679076,
    "spentComplexity": 0
}

View: original | compacted
Prev: EtQDHpiKMzLeijgCxFKLgMCwD9NZEvCWX9Pgj11P15CQ
Next: Sx7ofUUpnr5r8gMpVWYmtVhLQQDiesXbwyhhxM3yr1A

Diff: 
Old New Differences
28 28              else {
29 29                  let n = (k + 1)
30 30                  let o = (m + 1)
31 -                 WriteSet([DataEntry((toString(o) + "_event"), j), DataEntry((toString(o) + "_qoef1"), d(a, (k - l))), DataEntry((toString(o) + "_qoef2"), g(d(a, (k - l)))), DataEntry("q1_next", d(a, ((k + 1) - l))), DataEntry("q2_next", g(d(a, ((k - 1) - l)))), DataEntry("n", n), DataEntry("count", o)])
31 +                 WriteSet([DataEntry((toString(o) + "_event"), j), DataEntry((toString(o) + "_qoef1"), d(a, (k - l))), DataEntry((toString(o) + "_qoef2"), g(d(a, (k - l)))), DataEntry("q1_next", d(a, ((k + 1) - l))), DataEntry("q2_next", g(d(a, ((k + 1) - l)))), DataEntry("n", n), DataEntry("count", o)])
32 32                  }
33 33          else if ((100 > g(d(a, ((l - k) + 1)))))
34 34              then throw("to low coef")
35 35              else {
36 36                  let p = (l + 1)
37 37                  let o = (m + 1)
38 -                 WriteSet([DataEntry((toString(o) + "_event"), j), DataEntry((toString(o) + "_qoef2"), g(d(a, (k - l)))), DataEntry("q1_next", d(a, ((k + 1) - l))), DataEntry("q2_next", g(d(a, ((k - 1) - l)))), DataEntry((toString(o) + "_qoef1"), d(a, (k - l))), DataEntry("m", p), DataEntry("count", o)])
38 +                 WriteSet([DataEntry((toString(o) + "_event"), j), DataEntry((toString(o) + "_qoef2"), g(d(a, (k - l)))), DataEntry("q1_next", d(a, ((k - 1) - l))), DataEntry("q2_next", g(d(a, ((k - 1) - l)))), DataEntry((toString(o) + "_qoef1"), d(a, (k - l))), DataEntry("m", p), DataEntry("count", o)])
39 39                  }
40 40      }
41 41  
Full: 
Old New Differences
1 1  {-# STDLIB_VERSION 3 #-}
2 2  {-# SCRIPT_TYPE ACCOUNT #-}
3 3  {-# CONTENT_TYPE DAPP #-}
4 4  let a = 190
5 5  
6 6  let b = 190
7 7  
8 8  let c = 10
9 9  
10 10  func d (e,f) = ((e * (((-47 * f) * f) + 10000)) / 10000)
11 11  
12 12  
13 13  func g (e) = {
14 14      let h = 52
15 15      pow(((h + 1000) - (100000 / e)), 0, -1, 0, 5, DOWN)
16 16      }
17 17  
18 18  
19 19  @Callable(i)
20 20  func bet (j) = {
21 21      let k = getIntegerValue(this, "n")
22 22      let l = getIntegerValue(this, "m")
23 23      let m = getIntegerValue(this, "count")
24 24      let f = (k - l)
25 25      if ((j == 1))
26 26          then if ((100 > d(a, ((k + 1) - l))))
27 27              then throw("to low coef")
28 28              else {
29 29                  let n = (k + 1)
30 30                  let o = (m + 1)
31 -                 WriteSet([DataEntry((toString(o) + "_event"), j), DataEntry((toString(o) + "_qoef1"), d(a, (k - l))), DataEntry((toString(o) + "_qoef2"), g(d(a, (k - l)))), DataEntry("q1_next", d(a, ((k + 1) - l))), DataEntry("q2_next", g(d(a, ((k - 1) - l)))), DataEntry("n", n), DataEntry("count", o)])
31 +                 WriteSet([DataEntry((toString(o) + "_event"), j), DataEntry((toString(o) + "_qoef1"), d(a, (k - l))), DataEntry((toString(o) + "_qoef2"), g(d(a, (k - l)))), DataEntry("q1_next", d(a, ((k + 1) - l))), DataEntry("q2_next", g(d(a, ((k + 1) - l)))), DataEntry("n", n), DataEntry("count", o)])
32 32                  }
33 33          else if ((100 > g(d(a, ((l - k) + 1)))))
34 34              then throw("to low coef")
35 35              else {
36 36                  let p = (l + 1)
37 37                  let o = (m + 1)
38 -                 WriteSet([DataEntry((toString(o) + "_event"), j), DataEntry((toString(o) + "_qoef2"), g(d(a, (k - l)))), DataEntry("q1_next", d(a, ((k + 1) - l))), DataEntry("q2_next", g(d(a, ((k - 1) - l)))), DataEntry((toString(o) + "_qoef1"), d(a, (k - l))), DataEntry("m", p), DataEntry("count", o)])
38 +                 WriteSet([DataEntry((toString(o) + "_event"), j), DataEntry((toString(o) + "_qoef2"), g(d(a, (k - l)))), DataEntry("q1_next", d(a, ((k - 1) - l))), DataEntry("q2_next", g(d(a, ((k - 1) - l)))), DataEntry((toString(o) + "_qoef1"), d(a, (k - l))), DataEntry("m", p), DataEntry("count", o)])
39 39                  }
40 40      }
41 41  
42 42  
43 43  @Verifier(i)
44 44  func q () = true
45 45

Old	New		Differences
28	28		else {
29	29		let n = (k + 1)
30	30		let o = (m + 1)
31		-	WriteSet([DataEntry((toString(o) + "_event"), j), DataEntry((toString(o) + "_qoef1"), d(a, (k - l))), DataEntry((toString(o) + "_qoef2"), g(d(a, (k - l)))), DataEntry("q1_next", d(a, ((k + 1) - l))), DataEntry("q2_next", g(d(a, ((k - 1) - l)))), DataEntry("n", n), DataEntry("count", o)])
	31	+	WriteSet([DataEntry((toString(o) + "_event"), j), DataEntry((toString(o) + "_qoef1"), d(a, (k - l))), DataEntry((toString(o) + "_qoef2"), g(d(a, (k - l)))), DataEntry("q1_next", d(a, ((k + 1) - l))), DataEntry("q2_next", g(d(a, ((k + 1) - l)))), DataEntry("n", n), DataEntry("count", o)])
32	32		}
33	33		else if ((100 > g(d(a, ((l - k) + 1)))))
34	34		then throw("to low coef")
35	35		else {
36	36		let p = (l + 1)
37	37		let o = (m + 1)
38		-	WriteSet([DataEntry((toString(o) + "_event"), j), DataEntry((toString(o) + "_qoef2"), g(d(a, (k - l)))), DataEntry("q1_next", d(a, ((k + 1) - l))), DataEntry("q2_next", g(d(a, ((k - 1) - l)))), DataEntry((toString(o) + "_qoef1"), d(a, (k - l))), DataEntry("m", p), DataEntry("count", o)])
	38	+	WriteSet([DataEntry((toString(o) + "_event"), j), DataEntry((toString(o) + "_qoef2"), g(d(a, (k - l)))), DataEntry("q1_next", d(a, ((k - 1) - l))), DataEntry("q2_next", g(d(a, ((k - 1) - l)))), DataEntry((toString(o) + "_qoef1"), d(a, (k - l))), DataEntry("m", p), DataEntry("count", o)])
39	39		}
40	40		}
41	41

Old	New		Differences
1	1		{-# STDLIB_VERSION 3 #-}
2	2		{-# SCRIPT_TYPE ACCOUNT #-}
3	3		{-# CONTENT_TYPE DAPP #-}
4	4		let a = 190
5	5
6	6		let b = 190
7	7
8	8		let c = 10
9	9
10	10		func d (e,f) = ((e * (((-47 * f) * f) + 10000)) / 10000)
11	11
12	12
13	13		func g (e) = {
14	14		let h = 52
15	15		pow(((h + 1000) - (100000 / e)), 0, -1, 0, 5, DOWN)
16	16		}
17	17
18	18
19	19		@Callable(i)
20	20		func bet (j) = {
21	21		let k = getIntegerValue(this, "n")
22	22		let l = getIntegerValue(this, "m")
23	23		let m = getIntegerValue(this, "count")
24	24		let f = (k - l)
25	25		if ((j == 1))
26	26		then if ((100 > d(a, ((k + 1) - l))))
27	27		then throw("to low coef")
28	28		else {
29	29		let n = (k + 1)
30	30		let o = (m + 1)
31		-	WriteSet([DataEntry((toString(o) + "_event"), j), DataEntry((toString(o) + "_qoef1"), d(a, (k - l))), DataEntry((toString(o) + "_qoef2"), g(d(a, (k - l)))), DataEntry("q1_next", d(a, ((k + 1) - l))), DataEntry("q2_next", g(d(a, ((k - 1) - l)))), DataEntry("n", n), DataEntry("count", o)])
	31	+	WriteSet([DataEntry((toString(o) + "_event"), j), DataEntry((toString(o) + "_qoef1"), d(a, (k - l))), DataEntry((toString(o) + "_qoef2"), g(d(a, (k - l)))), DataEntry("q1_next", d(a, ((k + 1) - l))), DataEntry("q2_next", g(d(a, ((k + 1) - l)))), DataEntry("n", n), DataEntry("count", o)])
32	32		}
33	33		else if ((100 > g(d(a, ((l - k) + 1)))))
34	34		then throw("to low coef")
35	35		else {
36	36		let p = (l + 1)
37	37		let o = (m + 1)
38		-	WriteSet([DataEntry((toString(o) + "_event"), j), DataEntry((toString(o) + "_qoef2"), g(d(a, (k - l)))), DataEntry("q1_next", d(a, ((k + 1) - l))), DataEntry("q2_next", g(d(a, ((k - 1) - l)))), DataEntry((toString(o) + "_qoef1"), d(a, (k - l))), DataEntry("m", p), DataEntry("count", o)])
	38	+	WriteSet([DataEntry((toString(o) + "_event"), j), DataEntry((toString(o) + "_qoef2"), g(d(a, (k - l)))), DataEntry("q1_next", d(a, ((k - 1) - l))), DataEntry("q2_next", g(d(a, ((k - 1) - l)))), DataEntry((toString(o) + "_qoef1"), d(a, (k - l))), DataEntry("m", p), DataEntry("count", o)])
39	39		}
40	40		}
41	41
42	42
43	43		@Verifier(i)
44	44		func q () = true
45	45

github/deemru/w8io/873ac7e 
42.85 ms ◑