https:\/\/greentreesnakes.readthedocs.io\/en\/latest\/nodes.html<\/a><\/p>\n\u5b8c\u6574\u4ee3\u7801\u5982\u4e0b<\/p>\n
\r\n\r\n#!\/usr\/bin\/python\r\n\r\n# from http:\/\/evalidate.readthedocs.io\/en\/latest\/\r\n"""Safe user-supplied python expression evaluation."""\r\n\r\nimport ast\r\nimport sys\r\n\r\nversion = '0.6'\r\n\r\n\r\nclass SafeAST(ast.NodeVisitor):\r\n\r\n """AST-tree walker class."""\r\n\r\n allowed = {}\r\n\r\n def __init__(self, safenodes=None, addnodes=None):\r\n """create whitelist of allowed operations."""\r\n if safenodes is not None:\r\n self.allowed = safenodes\r\n else:\r\n '''Nodes doc: https:\/\/greentreesnakes.readthedocs.io\/en\/latest\/nodes.html'''\r\n # 123, 'asdf'\r\n values = ['Num', 'Str']\r\n # any expression\r\n expression = ['Expression']\r\n # == ...\r\n compare = ['Compare', 'Eq', 'NotEq', 'Gt', 'GtE', 'Lt', 'LtE']\r\n # variable name\r\n variables = ['Name', 'Load']\r\n binop = ['BinOp']\r\n arithmetics = ['Add', 'Sub', 'Div']\r\n subscript = ['Subscript', 'Index'] # person['name']\r\n boolop = ['BoolOp', 'And', 'Or', 'UnaryOp', 'Not'] # True and True\r\n inop = ["In"] # "aaa" in i['list']\r\n ifop = ["IfExp"] # for if expressions, like: expr1 if expr2 else expr3\r\n nameconst = ["NameConstant"] # for True and False constants\r\n\r\n self.allowed = expression + values + compare + variables + binop + \\\r\n arithmetics + subscript + boolop + inop + ifop + nameconst\r\n\r\n if addnodes is not None:\r\n self.allowed = self.allowed + addnodes\r\n\r\n def generic_visit(self, node):\r\n """Check node, rais exception is node is not in whitelist."""\r\n if type(node).__name__ in self.allowed:\r\n ast.NodeVisitor.generic_visit(self, node)\r\n else:\r\n raise ValueError(\r\n "Operaton type {optype} is not allowed".format(\r\n optype=type(node).__name__))\r\n\r\n\r\ndef evalidate(expression, safenodes=None, addnodes=None):\r\n """Validate expression.\r\n\r\n return node if it passes our checks\r\n or pass exception from SafeAST visit.\r\n """\r\n node = ast.parse(expression, '<usercode>', 'eval')\r\n\r\n v = SafeAST(safenodes, addnodes)\r\n v.visit(node)\r\n return node\r\n\r\n\r\ndef safeeval(src, context={}, safenodes=None, addnodes=None):\r\n """C-style simplified wrapper, eval() replacement."""\r\n try:\r\n node = evalidate(src, safenodes, addnodes)\r\n except Exception as e:\r\n return (False, "Validation error: "+e.__str__())\r\n\r\n try:\r\n code = compile(node, '<usercode>', 'eval')\r\n except Exception as e:\r\n return (False, "Compile error: "+e.__str__())\r\n\r\n try:\r\n wcontext = context.copy()\r\n result = eval(code, wcontext)\r\n except Exception as e:\r\n et, ev, erb = sys.exc_info()\r\n return False, "Runtime error ({}): {}".format(type(e).__name__, ev)\r\n\r\n return (True, result)\r\n\r\n\r\nif __name__ == '__main__':\r\n\r\n books = [\r\n {\r\n 'title': 'The Sirens of Titan',\r\n 'author': 'Kurt Vonnegut',\r\n 'stock': 10,\r\n 'price': 9.71\r\n },\r\n {\r\n 'title': 'Cat\\'s Cradle',\r\n 'author': 'Kurt Vonnegut',\r\n 'stock': 2,\r\n 'price': 4.23\r\n },\r\n {\r\n 'title': 'Chapaev i Pustota',\r\n 'author': 'Victor Pelevin',\r\n 'stock': 0,\r\n 'price': 21.33\r\n },\r\n {\r\n 'title': 'Gone Girl',\r\n 'author': 'Gillian Flynn',\r\n 'stock': 5,\r\n 'price': 8.97\r\n },\r\n ]\r\n\r\n #src = 'stock>= (5 if price<9 else 0)' src = 'stock>5 or price>10'\r\n\r\n for book in books:\r\n success, result = safeeval(src, book)\r\n if success:\r\n if result:\r\n print(book)\r\n else:\r\n print("ERR: ", result)\r\n\r\n print safeeval("os.system('whoami')")\r\n print safeeval('import os')\r\n print safeeval("__import__('os').system('dir') ")\r\n print safeeval('a + (3 if 3>b else b) \/ c', {'a':5, 'b':1, 'c':2})\r\n print safeeval('a + b**3', {'a':5, 'b':1, 'c':2})\r\n\r\n<\/pre>\n\u65b9\u6cd5\u4e00\u4ee3\u7801\u5982\u4e0b<\/p>\n
\r\n""""\r\n The orignal author: Alexer \/ #python.fi\r\n"""\r\n\r\nimport opcode\r\nimport dis\r\nimport sys\r\nimport multiprocessing\r\nimport time\r\n\r\n# Python 3 required\r\nassert sys.version_info[0] == 3, "No country for old snakes"\r\n\r\n\r\nclass UnknownSymbol(Exception):\r\n """ There was a function or constant in the expression we don't support. """\r\n\r\n\r\nclass BadValue(Exception):\r\n """ The user tried to input dangerously big value. """\r\n\r\n MAX_ALLOWED_VALUE = 2**63\r\n\r\n\r\nclass BadCompilingInput(Exception):\r\n """ The user tried to input something which might cause compiler to slow down. """\r\n\r\n\r\nclass TimeoutException(Exception):\r\n """ It took too long to compile and execute. """\r\n\r\n\r\nclass RunnableProcessing(multiprocessing.Process):\r\n """ Run a function in a child process.\r\n Pass back any exception received.\r\n """\r\n def __init__(self, func, *args, **kwargs):\r\n self.queue = multiprocessing.Queue(maxsize=1)\r\n args = (func,) + args\r\n multiprocessing.Process.__init__(self, target=self.run_func, args=args, kwargs=kwargs)\r\n\r\n def run_func(self, func, *args, **kwargs):\r\n try:\r\n result = func(*args, **kwargs)\r\n self.queue.put((True, result))\r\n except Exception as e:\r\n self.queue.put((False, e))\r\n\r\n def done(self):\r\n return self.queue.full()\r\n\r\n def result(self):\r\n return self.queue.get()\r\n\r\n\r\ndef timeout(seconds, force_kill=True):\r\n """ Timeout decorator using Python multiprocessing.\r\n Courtesy of http:\/\/code.activestate.com\/recipes\/577853-timeout-decorator-with-multiprocessing\/\r\n """\r\n def wrapper(function):\r\n def inner(*args, **kwargs):\r\n now = time.time()\r\n proc = RunnableProcessing(function, *args, **kwargs)\r\n proc.start()\r\n proc.join(seconds)\r\n if proc.is_alive():\r\n if force_kill:\r\n proc.terminate()\r\n runtime = time.time() - now\r\n raise TimeoutException('timed out after {0} seconds'.format(runtime))\r\n assert proc.done()\r\n success, result = proc.result()\r\n if success:\r\n return result\r\n else:\r\n raise result\r\n return inner\r\n return wrapper\r\n\r\n\r\ndef disassemble(co):\r\n """ Loop through Python bytecode and match instructions with our internal opcodes.\r\n :param co: Python code object\r\n """\r\n code = co.co_code\r\n n = len(code)\r\n i = 0\r\n extended_arg = 0\r\n result = []\r\n while i < n: op = code[i] curi = i i = i+1 if op >= dis.HAVE_ARGUMENT:\r\n # Python 2\r\n # oparg = ord(code[i]) + ord(code[i+1])*256 + extended_arg\r\n oparg = code[i] + code[i+1] * 256 + extended_arg\r\n extended_arg = 0\r\n i = i+2\r\n if op == dis.EXTENDED_ARG:\r\n # Python 2\r\n #extended_arg = oparg*65536L\r\n extended_arg = oparg*65536\r\n else:\r\n oparg = None\r\n\r\n # print(opcode.opname[op])\r\n\r\n opv = globals()[opcode.opname[op].replace('+', '_')](co, curi, i, op, oparg)\r\n\r\n result.append(opv)\r\n\r\n return result\r\n\r\n# For the opcodes see dis.py\r\n# (Copy-paste)\r\n# https:\/\/docs.python.org\/2\/library\/dis.html\r\n\r\nclass Opcode:\r\n """ Base class for out internal opcodes. """\r\n args = 0\r\n pops = 0\r\n pushes = 0\r\n def __init__(self, co, i, nexti, op, oparg):\r\n self.co = co\r\n self.i = i\r\n self.nexti = nexti\r\n self.op = op\r\n self.oparg = oparg\r\n\r\n def get_pops(self):\r\n return self.pops\r\n\r\n def get_pushes(self):\r\n return self.pushes\r\n\r\n def touch_value(self, stack, frame):\r\n assert self.pushes == 0\r\n for i in range(self.pops):\r\n stack.pop()\r\n\r\n\r\nclass OpcodeArg(Opcode):\r\n args = 1\r\n\r\n\r\nclass OpcodeConst(OpcodeArg):\r\n def get_arg(self):\r\n return self.co.co_consts[self.oparg]\r\n\r\n\r\nclass OpcodeName(OpcodeArg):\r\n def get_arg(self):\r\n return self.co.co_names[self.oparg]\r\n\r\n\r\nclass POP_TOP(Opcode):\r\n """Removes the top-of-stack (TOS) item."""\r\n pops = 1\r\n def touch_value(self, stack, frame):\r\n stack.pop()\r\n\r\n\r\nclass DUP_TOP(Opcode):\r\n """Duplicates the reference on top of the stack."""\r\n # XXX: +-1\r\n pops = 1\r\n pushes = 2\r\n def touch_value(self, stack, frame):\r\n stack[-1:] = 2 * stack[-1:]\r\n\r\n\r\nclass ROT_TWO(Opcode):\r\n """Swaps the two top-most stack items."""\r\n pops = 2\r\n pushes = 2\r\n def touch_value(self, stack, frame):\r\n stack[-2:] = stack[-2:][::-1]\r\n\r\n\r\nclass ROT_THREE(Opcode):\r\n """Lifts second and third stack item one position up, moves top down to position three."""\r\n pops = 3\r\n pushes = 3\r\n direct = True\r\n def touch_value(self, stack, frame):\r\n v3, v2, v1 = stack[-3:]\r\n stack[-3:] = [v1, v3, v2]\r\n\r\n\r\nclass ROT_FOUR(Opcode):\r\n """Lifts second, third and forth stack item one position up, moves top down to position four."""\r\n pops = 4\r\n pushes = 4\r\n direct = True\r\n def touch_value(self, stack, frame):\r\n v4, v3, v2, v1 = stack[-3:]\r\n stack[-3:] = [v1, v4, v3, v2]\r\n\r\n\r\nclass UNARY(Opcode):\r\n """Unary Operations take the top of the stack, apply the operation, and push the result back on the stack."""\r\n pops = 1\r\n pushes = 1\r\n\r\n\r\nclass UNARY_POSITIVE(UNARY):\r\n """Implements TOS = +TOS."""\r\n def touch_value(self, stack, frame):\r\n stack[-1] = +stack[-1]\r\n\r\n\r\nclass UNARY_NEGATIVE(UNARY):\r\n """Implements TOS = -TOS."""\r\n def touch_value(self, stack, frame):\r\n stack[-1] = -stack[-1]\r\n\r\n\r\nclass BINARY(Opcode):\r\n """Binary operations remove the top of the stack (TOS) and the second top-most stack item (TOS1) from the stack. \r\nThey perform the operation, and put the result back on the stack."""\r\n pops = 2\r\n pushes = 1\r\n\r\n\r\nclass BINARY_POWER(BINARY):\r\n """Implements TOS = TOS1 ** TOS."""\r\n def touch_value(self, stack, frame):\r\n TOS1, TOS = stack[-2:]\r\n print(TOS1, TOS)\r\n if abs(TOS1) > BadValue.MAX_ALLOWED_VALUE or abs(TOS) > BadValue.MAX_ALLOWED_VALUE:\r\n raise BadValue("The value for exponent was too big")\r\n\r\n stack[-2:] = [TOS1 ** TOS]\r\n\r\n\r\nclass BINARY_MULTIPLY(BINARY):\r\n """Implements TOS = TOS1 * TOS."""\r\n def touch_value(self, stack, frame):\r\n TOS1, TOS = stack[-2:]\r\n stack[-2:] = [TOS1 * TOS]\r\n\r\n\r\nclass BINARY_DIVIDE(BINARY):\r\n """Implements TOS = TOS1 \/ TOS when from __future__ import division is not in effect."""\r\n def touch_value(self, stack, frame):\r\n TOS1, TOS = stack[-2:]\r\n stack[-2:] = [TOS1 \/ TOS]\r\n\r\n\r\nclass BINARY_MODULO(BINARY):\r\n """Implements TOS = TOS1 % TOS."""\r\n def touch_value(self, stack, frame):\r\n TOS1, TOS = stack[-2:]\r\n stack[-2:] = [TOS1 % TOS]\r\n\r\n\r\nclass BINARY_ADD(BINARY):\r\n """Implements TOS = TOS1 + TOS."""\r\n def touch_value(self, stack, frame):\r\n TOS1, TOS = stack[-2:]\r\n stack[-2:] = [TOS1 + TOS]\r\n\r\n\r\nclass BINARY_SUBTRACT(BINARY):\r\n """Implements TOS = TOS1 - TOS."""\r\n def touch_value(self, stack, frame):\r\n TOS1, TOS = stack[-2:]\r\n stack[-2:] = [TOS1 - TOS]\r\n\r\n\r\nclass BINARY_FLOOR_DIVIDE(BINARY):\r\n """Implements TOS = TOS1 \/\/ TOS."""\r\n def touch_value(self, stack, frame):\r\n TOS1, TOS = stack[-2:]\r\n stack[-2:] = [TOS1 \/\/ TOS]\r\n\r\n\r\nclass BINARY_TRUE_DIVIDE(BINARY):\r\n """Implements TOS = TOS1 \/ TOS when from __future__ import division is in effect."""\r\n def touch_value(self, stack, frame):\r\n TOS1, TOS = stack[-2:]\r\n stack[-2:] = [TOS1 \/ TOS]\r\n\r\n\r\nclass BINARY_LSHIFT(BINARY):\r\n """Implements TOS = TOS1 << TOS."""\r\n def touch_value(self, stack, frame):\r\n TOS1, TOS = stack[-2:]\r\n stack[-2:] = [TOS1 << TOS] class BINARY_RSHIFT(BINARY): """Implements TOS = TOS1 >> TOS."""\r\n def touch_value(self, stack, frame):\r\n TOS1, TOS = stack[-2:]\r\n stack[-2:] = [TOS1 >> TOS]\r\n\r\n\r\nclass BINARY_AND(BINARY):\r\n """Implements TOS = TOS1 & TOS."""\r\n def touch_value(self, stack, frame):\r\n TOS1, TOS = stack[-2:]\r\n stack[-2:] = [TOS1 & TOS]\r\n\r\n\r\nclass BINARY_XOR(BINARY):\r\n """Implements TOS = TOS1 ^ TOS."""\r\n def touch_value(self, stack, frame):\r\n TOS1, TOS = stack[-2:]\r\n stack[-2:] = [TOS1 ^ TOS]\r\n\r\n\r\nclass BINARY_OR(BINARY):\r\n """Implements TOS = TOS1 | TOS."""\r\n def touch_value(self, stack, frame):\r\n TOS1, TOS = stack[-2:]\r\n stack[-2:] = [TOS1 | TOS]\r\n\r\n\r\nclass RETURN_VALUE(Opcode):\r\n """Returns with TOS to the caller of the function."""\r\n pops = 1\r\n final = True\r\n def touch_value(self, stack, frame):\r\n value = stack.pop()\r\n return value\r\n\r\n\r\nclass LOAD_CONST(OpcodeConst):\r\n """Pushes co_consts[consti] onto the stack.""" # consti\r\n pushes = 1\r\n def touch_value(self, stack, frame):\r\n # XXX moo: Validate type\r\n value = self.get_arg()\r\n assert isinstance(value, (int, float))\r\n stack.append(value)\r\n\r\n\r\nclass LOAD_NAME(OpcodeName):\r\n """Pushes the value associated with co_names[namei] onto the stack.""" # namei\r\n pushes = 1\r\n def touch_value(self, stack, frame):\r\n # XXX moo: Get name from dict of valid variables\/functions\r\n name = self.get_arg()\r\n if name not in frame:\r\n raise UnknownSymbol("Does not know symbol {}".format(name))\r\n stack.append(frame[name])\r\n\r\n\r\nclass CALL_FUNCTION(OpcodeArg):\r\n """Calls a function. The low byte of argc indicates the number of positional parameters, the high byte the number of keyword parameters. \r\nOn the stack, the opcode finds the keyword parameters first. For each keyword argument,\r\n the value is on top of the key. Below the keyword parameters, the positional parameters are on the stack, \r\nwith the right-most parameter on top. Below the parameters, the function object to call is on the stack. Pops all function arguments,\r\n and the function itself off the stack, and pushes the return value.""" # argc\r\n pops = None\r\n pushes = 1\r\n\r\n def get_pops(self):\r\n args = self.oparg & 0xff\r\n kwargs = (self.oparg >> 8) & 0xff\r\n return 1 + args + 2 * kwargs\r\n\r\n def touch_value(self, stack, frame):\r\n argc = self.oparg & 0xff\r\n kwargc = (self.oparg >> 8) & 0xff\r\n assert kwargc == 0\r\n if argc > 0:\r\n args = stack[-argc:]\r\n stack[:] = stack[:-argc]\r\n else:\r\n args = []\r\n func = stack.pop()\r\n\r\n assert func in frame.values(), "Uh-oh somebody injected bad function. This does not happen."\r\n\r\n result = func(*args)\r\n stack.append(result)\r\n\r\n\r\ndef check_for_pow(expr):\r\n """ Python evaluates power operator during the compile time if its on constants.\r\n You can do CPU \/ memory burning attack with ``2**999999999999999999999**9999999999999``.\r\n We mainly care about memory now, as we catch timeoutting in any case.\r\n We just disable pow and do not care about it.\r\n """\r\n if "**" in expr:\r\n raise BadCompilingInput("Power operation is not allowed")\r\n\r\n\r\ndef _safe_eval(expr, functions_and_constants={}, check_compiling_input=True):\r\n """ Evaluate a Pythonic math expression and return the output as a string.\r\n The expr is limited to 1024 characters \/ 1024 operations\r\n to prevent CPU burning or memory stealing.\r\n :param functions_and_constants: Supplied "built-in" data for evaluation\r\n """\r\n\r\n # Some safety checks\r\n assert len(expr) < 1024\r\n\r\n # Check for potential bad compiler input\r\n if check_compiling_input:\r\n check_for_pow(expr)\r\n\r\n # Compile Python source code to Python code for eval()\r\n code = compile(expr, '', 'eval')\r\n\r\n # Dissect bytecode back to Python opcodes\r\n ops = disassemble(code)\r\n assert len(ops) < 1024\r\n\r\n stack = []\r\n for op in ops:\r\n value = op.touch_value(stack, functions_and_constants)\r\n\r\n return value\r\n\r\n\r\n@timeout(0.1)\r\ndef safe_eval_timeout(expr, functions_and_constants={}, check_compiling_input=True):\r\n """ Hardered compile + eval for long running maths.\r\n Mitigate against CPU burning attacks.\r\n If some nasty user figures out a way around our limitations to make really really slow calculations.\r\n """\r\n return _safe_eval(expr, functions_and_constants, check_compiling_input)\r\n\r\n\r\nif __name__ == "__main__":\r\n\r\n # Run some self testing\r\n\r\n def test_eval(expected_result, *args):\r\n result = safe_eval_timeout(*args)\r\n if result != expected_result:\r\n raise AssertionError("Got: {} expected: {}".format(result, expected_result))\r\n\r\n test_eval(2, "1+1")\r\n test_eval(2, "1 + 1")\r\n test_eval(3, "a + b", dict(a=1, b=2))\r\n test_eval(2, "max(1, 2)", dict(max=max))\r\n test_eval(2, "max(a, b)", dict(a=1, b=2, max=max))\r\n test_eval(3, "max(a, c, b)", dict(a=1, b=2, c=3, max=max))\r\n test_eval(3, "max(a, max(c, b))", dict(a=1, b=2, c=3, max=max))\r\n test_eval("2", "str(1 + 1)", dict(str=str))\r\n test_eval(2.5, "(a + b) \/ c", dict(a=4, b=1, c=2))\r\n\r\n try:\r\n test_eval(None, "max(1, 0)")\r\n raise AssertionError("Should not be reached")\r\n except UnknownSymbol:\r\n pass\r\n\r\n # CPU burning\r\n try:\r\n test_eval(None, "2**999999999999999999999**9999999999")\r\n raise AssertionError("Should not be reached")\r\n except BadCompilingInput:\r\n pass\r\n\r\n # CPU burning, see out timeoutter works\r\n try:\r\n safe_eval_timeout("2**999999999999999999999**9999999999", check_compiling_input=False)\r\n raise AssertionError("Should not be reached")\r\n except TimeoutException:\r\n pass\r\n\r\n try:\r\n test_eval(None, "1 \/ 0")\r\n raise AssertionError("Should not be reached")\r\n except ZeroDivisionError:\r\n pass\r\n\r\n try:\r\n test_eval(None, "(((((((((((((((()")\r\n raise AssertionError("Should not be reached")\r\n except SyntaxError:\r\n # for i in range(0, 100):\r\n # ^\r\n # SyntaxError: invalid synta\r\n pass\r\n\r\n try:\r\n test_eval(None, "")\r\n raise AssertionError("Should not be reached")\r\n except SyntaxError:\r\n # SyntaxError: unexpected EOF while parsing\r\n pass\r\n\r\n # compile() should not allow multiline stuff\r\n # http:\/\/stackoverflow.com\/q\/12698028\/315168\r\n try:\r\n test_eval(None, "for i in range(0, 100):\\n pass", dict(i=-1))\r\n raise AssertionError("Should not be reached")\r\n except SyntaxError:\r\n # for i in range(0, 100):\r\n # ^\r\n # SyntaxError: invalid synta\r\n pass\r\n\r\n # No functions allowed\r\n try:\r\n test_eval(None, "lamdba x: x+1")\r\n raise AssertionError("Should not be reached")\r\n except SyntaxError:\r\n # SyntaxError: unexpected EOF while parsing\r\n pass\r\n\r\n<\/pre>\n\u53c2\u8003\u6765\u6e90\uff1a<\/p>\n
\n- https:\/\/github.com\/aosabook\/500lines\/blob\/master\/template-engine\/code\/templite.py<\/li>\n
- https:\/\/github.com\/greysign\/pysec\/blob\/master\/safeeval.py<\/li>\n
- http:\/\/rinige.com\/index.php\/archives\/571\/<\/li>\n
- http:\/\/evalidate.readthedocs.io\/en\/latest\/<\/li>\n
- https:\/\/opensourcehacker.com\/2014\/10\/29\/safe-evaluation-of-math-expressions-in-pure-python\/<\/li>\n
- https:\/\/gist.github.com\/miohtama\/34a83d870a14aa7e580d<\/li>\n
- https:\/\/greentreesnakes.readthedocs.io\/en\/latest\/nodes.html<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"
python\u4e2d\u7684eval\u51fd\u6570\u975e\u5e38\u5f3a\u5927\uff0c\u53ef\u4ee5\u6267\u884c\u8f93\u5165\u7684\u5b57\u7b26\u4e32\u52a8\u6001\u4ee3\u7801\uff0c\u4f8b\u5982\uff1a >>> eval […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[6],"tags":[],"class_list":["post-6555","post","type-post","status-publish","format-standard","hentry","category-code_related"],"_links":{"self":[{"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/posts\/6555","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/comments?post=6555"}],"version-history":[{"count":4,"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/posts\/6555\/revisions"}],"predecessor-version":[{"id":6559,"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/posts\/6555\/revisions\/6559"}],"wp:attachment":[{"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/media?parent=6555"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/categories?post=6555"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/kyle.ai\/blog\/wp-json\/wp\/v2\/tags?post=6555"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}